Timed Petri net models of queueing systems

Zuberek, W. M. (1988) Timed Petri net models of queueing systems. In: Seventh Annual International Phoenix Conference on Computers an Communications, 16-18 March 1988, Scottsdale, AZ, USA.

[img] [English] PDF - Accepted Version
Available under License Creative Commons Attribution Non-commercial.

Download (216kB)


It is shown that for timed Petri nets with exponentially distributed firing times (M-timed Petri nets), the state space can be generated directly from net specifications, and then the stationary probabilities of states can be obtained by standard methods, developed for analysis of (continuous-time) Markov chains. Numerous performance measures can be derived from stationary probabilities of states. For unbounded nets (models of open network systems are usually unbounded), the state space is infinite. A transformation is thus needed that folds this infinite space into a finite representation, used for effective evaluation of probabilities. The author presents a short theoretical background for performance evaluation using timed Petri nets, followed by several examples of closed and open network models of simple computer systems.

Item Type: Conference or Workshop Item (Paper)
URI: http://research.library.mun.ca/id/eprint/14754
Item ID: 14754
Department(s): Science, Faculty of > Computer Science
Date: March 1988
Date Type: Completion
Digital Object Identifier (DOI): https://doi.org/10.1109/PCCC.1988.10093
Related URLs:

Actions (login required)

View Item View Item


Downloads per month over the past year

View more statistics