Augmented M-timed Petri nets, modeling and performance evaluation of computer systems

Zuberek, W.M.

Transactions of the Society for Computer Simulation, vol.2, no.2, pp.135-153, 1985.

Abstract:

It is shown that the behavior of augmented (i.e., generalized and extended) free-choice Petri nets with exponentially distributed firing times can be represented by probabilistic state graphs. For bounded Petri nets the corresponding state graphs are finite, stationary descriptions can thus be obtained by standard techniques used for analysis of continuous-time finite-state Markov chains. An immediate application of such a model is performance analysis of concurrent systems, and in particular queueing systems with exponentially distributed interarrival and service times. Places of Petri nets correspond to systems queues, transitions to servers, inhibitor arcs are used to indicate priorities, and bulk arrivals or services are conveniently modelled by generalized (multiple) arcs. Simple models of interactive computer systems are used as an illustration of performance evaluation.

Keywords:

Timed Petri nets, state graphs, Markov chains, performance analysis.

References: