Modified M-timed Petri nets in modelling and performance evaluation of systems

Zuberek, W. M. (1987) Modified M-timed Petri nets in modelling and performance evaluation of systems. In: 15-th ACM Annual Computer Science Conference (CSC’87), February 17–19, 1987,, St. Louis, MO.

[img] [English] PDF (The version available in this research repository is a postprint. It has the same peer-reviewed content as the published version, but lacks publisher layout and branding.) - Accepted Version
Available under License Creative Commons Attribution Non-commercial.

Download (492kB)


Modified M-timed Petri nets are Petri nets with exponentially distributed firing times and with generalized inhibitor arcs to interrupt firing transitions. It is shown that the behavior of modified free-choice M-timed Petri nets can be represented by probabilistic state graphs, stationary probabilities of states can thus be obtained by standard techniques used for analysis of continuous-time homogeneous Markov chains. An immediate application of such a model is performance analysis of queueing systems with exponentially distributed service and interarrival times, and with priority and/or preemptive scheduling disciplines. Simple models of computer systems with different scheduling strategies are used as an illustration of modelling and performance analysis.

Item Type: Conference or Workshop Item (Paper)
Item ID: 14958
Department(s): Science, Faculty of > Computer Science
Date: February 1987
Date Type: Completion
Digital Object Identifier (DOI):
Related URLs:

Actions (login required)

View Item View Item


Downloads per month over the past year

View more statistics