An upper bound on the cycle time of a stochastic marked graph using incomplete information on the transition firing time distributions

Gerrit K. Janssens*, Kenneth Sörensen, Wout Dullaert

*Corresponding author for this work

Research output: Contribution to JournalArticleAcademicpeer-review

Abstract

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.

Original languageEnglish
Pages (from-to)563-572
Number of pages10
JournalMathematical and Computer Modelling
Volume49
Issue number3-4
DOIs
Publication statusPublished - Feb 2009

Keywords

  • Petri nets
  • Stochastic marked graphs

Fingerprint

Dive into the research topics of 'An upper bound on the cycle time of a stochastic marked graph using incomplete information on the transition firing time distributions'. Together they form a unique fingerprint.

Cite this