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.
16 lines
466 B
16 lines
466 B
const double T;
|
|
|
|
// long run expected customers in the network
|
|
R=?[S]
|
|
|
|
// probability network becomes full in T time units
|
|
P=? [ true U<=T sc=c & sm=c & ph=2 ]
|
|
|
|
// probability first queue becomes full in T time units
|
|
P=? [ true U<=T sc=c ]
|
|
|
|
// the minimimum probability of leaving a situation where the second queue is entirely populated within T time units
|
|
P=? [ sm=c U<=T sm<c {sm=c}{min} ]
|
|
|
|
// expected number of customers in the network
|
|
R=?[I=T]
|