You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
22 lines
778 B
22 lines
778 B
//Probability that in the long run station 1 is awaiting service
|
|
S=? [ s1=1 & !(s=1 & a=1) ]
|
|
|
|
// Probability that in the long run station 1 is idle
|
|
S=? [ s1=0 ]
|
|
|
|
// once a station becomes full, the minimum probability it will eventually be polled is ...
|
|
P=? [ true U (s=1 & a=0) {s1=1}{min} ]
|
|
|
|
// probability that from the inital state station 1 is served before station 2 is ...
|
|
P=? [ !(s=2 & a=1) U (s=1 & a=1) ]
|
|
|
|
// once a station becomes full, probability it will be polled within T time units is ...
|
|
const int T;
|
|
P=?[ true U<=T (s=1 & a=0) ]
|
|
|
|
// expected reward accumlated by time T
|
|
// waiting=1 and served=0 for expected time station 1 spends awaiting service
|
|
// waiting=0 and served=1 for expected number of times station 1 is served
|
|
R=?[C<=T]
|
|
|
|
|