Publication
Title
An upper bound on the cycle time of a stochastic marked graph using incomplet information on the transition firing time distributions
Author
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
Language
English
Source (journal)
Mathematical and computer modelling. - Oxford
Publication
Oxford : 2009
ISSN
0895-7177
Volume/pages
49:3-4(2009), p. 563-572
ISI
000262124500018
Full text (Publisher's DOI)
Full text (open access)
UAntwerpen
Faculty/Department
Research group
Publication type
Subject
Affiliation
Publications with a UAntwerp address
External links
Web of Science
Record
Identification
Creation 27.03.2009
Last edited 10.07.2017
To cite this reference