TY - JOUR
T1 - An upper bound on the cycle time of a stochastic marked graph using incomplete information on the transition firing time distributions
AU - Janssens, Gerrit K.
AU - Sörensen, Kenneth
AU - Dullaert, Wout
PY - 2009/2
Y1 - 2009/2
N2 - Stochastic marked graphs, a special class of stochastic timed Petri nets, are used for modelling and analyzing decision-free dynamic systems with uncertainties in timing. The model allows evaluating the performance of such systems under a cyclic process. Given the probabilistic characteristics of the transition times, the cycle time of the system can be determined from the initial marking. In this contribution, we compute an upper bound on the cycle time of a stochastic marked graph in case the probabilistic characteristics of the transition times are not fully specified.
AB - Stochastic marked graphs, a special class of stochastic timed Petri nets, are used for modelling and analyzing decision-free dynamic systems with uncertainties in timing. The model allows evaluating the performance of such systems under a cyclic process. Given the probabilistic characteristics of the transition times, the cycle time of the system can be determined from the initial marking. In this contribution, we compute an upper bound on the cycle time of a stochastic marked graph in case the probabilistic characteristics of the transition times are not fully specified.
KW - Petri nets
KW - Stochastic marked graphs
UR - http://www.scopus.com/inward/record.url?scp=58049164669&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=58049164669&partnerID=8YFLogxK
U2 - 10.1016/j.mcm.2008.04.012
DO - 10.1016/j.mcm.2008.04.012
M3 - Article
AN - SCOPUS:58049164669
SN - 0895-7177
VL - 49
SP - 563
EP - 572
JO - Mathematical and Computer Modelling
JF - Mathematical and Computer Modelling
IS - 3-4
ER -