s14h
/
prism-accumulation
1
0
Fork 0
Code Releases Activity
Browse Source

Moved labels to model in cluster. 

git-svn-id: https://www.prismmodelchecker.org/svn/prism/prism/trunk@1845 bbc10eb1-c90d-0410-af57-cb519fbb1720
master
Dave Parker 16 years ago
parent
55e52d5e22
commit
fa3b003c4c
2 changed files with 160 additions and 159 deletions
Whitespace
Show all changes Ignore whitespace when comparing lines Ignore changes in amount of whitespace Ignore changes in whitespace at EOL
Unified View
Diff Options
Show Stats Download Patch File Download Diff File
  1. 8
      prism-examples/cluster/cluster.csl
  2. 21
      prism-examples/cluster/cluster.sm

8
prism-examples/cluster/cluster.csl
View File

@ -1,13 +1,5 @@
// Properties based on those from [HHK00] // Properties based on those from [HHK00]
// left_operational_i : left_n>=i & toleft_n
// right_operational_i : right_n>=i & toright_n
// operational_i : (left_n+right_n)>=i & toleft_n & line_n & toright_n
// minimum_k : left_operational_k | right_operational_k | operational_k
// premium = minimum_N
label "minimum" = (left_n>=k & toleft_n) | (right_n>=k & toright_n) | ((left_n+right_n)>=k & toleft_n & line_n & toright_n);
label "premium" = (left_n>=left_mx & toleft_n) | (right_n>=right_mx & toright_n) | ((left_n+right_n)>=left_mx & toleft_n & line_n & toright_n);
const double T; const double T;
// In the long run, the probability that premium QoS will be delivered // In the long run, the probability that premium QoS will be delivered

21
prism-examples/cluster/cluster.sm
View File

@ -7,12 +7,6 @@ const int N; // Number of workstations in each cluster
const int left_mx = N; // Number of work stations in left cluster const int left_mx = N; // Number of work stations in left cluster
const int right_mx = N; // Number of work stations in right cluster const int right_mx = N; // Number of work stations in right cluster
// Minimum QoS requires 3/4 connected workstations operational
const int k = floor(0.75*N);
formula minimum = (left_n>=k & toleft_n) |
(right_n>=k & toright_n) |
((left_n+right_n)>=k & toleft_n & line_n & toright_n);
// Failure rates // Failure rates
const double ws_fail = 1/500; // Single workstation: average time to fail = 500 hrs const double ws_fail = 1/500; // Single workstation: average time to fail = 500 hrs
const double switch_fail = 1/4000; // Switch: average time to fail = 4000 hrs const double switch_fail = 1/4000; // Switch: average time to fail = 4000 hrs
@ -85,6 +79,21 @@ module ToRight = Line[line=toright,
repairLine=repairToRight ] repairLine=repairToRight ]
endmodule endmodule
// Formulas + labels
// Minimum QoS requires 3/4 connected workstations operational
const int k = floor(0.75*N);
// left_operational_i : left_n>=i & toleft_n
// right_operational_i : right_n>=i & toright_n
// operational_i : (left_n+right_n)>=i & toleft_n & line_n & toright_n
// minimum_k : left_operational_k | right_operational_k | operational_k
formula minimum = (left_n>=k & toleft_n) |
(right_n>=k & toright_n) |
((left_n+right_n)>=k & toleft_n & line_n & toright_n);
label "minimum" = (left_n>=k & toleft_n) | (right_n>=k & toright_n) | ((left_n+right_n)>=k & toleft_n & line_n & toright_n);
// premium = minimum_N
label "premium" = (left_n>=left_mx & toleft_n) | (right_n>=right_mx & toright_n) | ((left_n+right_n)>=left_mx & toleft_n & line_n & toright_n);
// Reward structures // Reward structures
// Percentage of operational workstations stations // Percentage of operational workstations stations

Write Preview
Loading…
Cancel
Save