M-timed Petri nets, priorities, preemptions, and performance evaluation of systems

Zuberek, W. M. (1986) M-timed Petri nets, priorities, preemptions, and performance evaluation of systems. In: Advances in Petri Nets 1985. APN 1985. Lecture Notes in Computer Science (222). Springer, Berlin, pp. 478-498. ISBN 9783540398226

[English] PDF - Published Version Available under License Creative Commons Attribution Non-commercial. Download (228kB)

Abstract

In M-timed Petri nets, firing times are exponentially distributed random variables associated with transitions of a net. Several classes of M-timed Petri nets are discussed in this paper to show increasing “modelling power” of different nets. Conflict-free nets can model M- and E k -type queueing systems. Free-choice nets can also represent H k -type systems. Systems with several classes of users and with service priorities assigned to user classes require nets with inhibitor arcs. Preemption of service can be represented by extended nets with escape (or generalized inhibitor) arcs. Finally, to provide flexible modelling of scheduling and decision strategies, enhanced Petri nets are introduced with two classes of transitions, immediate and timed ones, and with (exponentially distributed) firing times associated with the timed transitions. It is shown that the behavior of bounded M-timed Petri nets can be represented by finite “state” graphs which are finite-state continuous-time homogeneous Markov processes. Stationary probabilities of states can thus be obtained by standard techniques used for analysis of Markov chains, and then operational analysis can be applied for performance evaluation. Simple models of interactive systems are used as an illustration of modelling.

Actions (login required)

View Item