Generalized M-timed Petri nets and performance evaluation of computer systems

Zuberek, W.M.

INFOR Journal - Special Issue on Computer Systems Performance Evaluation, vol.23, no.3, pp.231-249, 1986.

Abstract:

It is shown that the behavior of generalized 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, 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, free-choice Petri nets, stationary behavior, performance evaluation, Markov chains.

References:

• T. Agerwala, "Putting Petri nets to work"; IEEE Computer Magazine, vol.12, no.12, pp.85-94, 1979.
• M. Ajmone Marsan, G. Conte, G. Balbo, "A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems"; ACM Tran. on Computer Systems, vol.2, no.2, pp.93-122, 1984.
• M. Diaz, "Modeling and analysis of communication and cooperation protocols using Petri net based models"; Computer Networks, vol.6, no.6, pp.419-441, 1982.
• D. Ferrari, Computer Systems Performance Evaluation; Prentice-Hall 1978.
• L. Kleinrock, Queueing systems, vol.1: "Theory", vol.2: "Computer Applications"; J. Wiley & Sons 1975, 1976.
• J. Magott, "Performance evaluation of concurrent systems using Petri nets"; Information Processing Letters, vol.18, no.1, pp.7-13, 1984.
• P.M. Merlin, D.J. Farber, "Recoverability of communication protocols - implications of a theoretical study"; IEEE Trans. on Communications, vol.24, no.9, pp.1036-1049, 1976.
• M.K. Molloy, "Performance analysis using stochastic Petri nets"; IEEE Trans. on Computers, vol.31, no.9, pp.913-917, 1982.
• J.L. Peterson, "Petri nets"; ACM Computing Surveys, vol.9, no.3, pp.223-252, 1977.
• J.L. Peterson, Petri Net Theory and the Modeling of Systems; Prentice-Hall 1981.
• C. Ramchandani, "Analysis of asynchronous concurrent systems by timed Petri nets"; Project MAC Technical Report MAC-TR-120, Massachusetts Institute of Technology, Cambridge MA, 1974.
• R.R. Razouk, "The derivation of performance expressions for communication protocols from timed Petri nets"; Computer Communication Review, vol.14, no.2, pp.210-217, 1984.
• J. Sifakis, "Use of Petri nets for performance evaluation"; in Measuring, Modelling and Evaluating Computer Systems, North-Holland 1977, pp.75-93.
• W.M. Zuberek, "Timed Petri nets and preliminary performance evaluation"; Proc. IEEE 7-th Annual Symp. on Computer Architecture, La Baule, France, pp.89-96, 1980.
• W.M. Zuberek, "Application of timed Petri nets to analysis of multiprocessor realizations of digital filters"; Proc. 25-th Midwest Symp. on Circuits and Systems, Houghton MI, pp.134-139, 1982.
• W.M. Zuberek, "Performance evaluation using extended timed Petri nets"; Proc. Int. Workshop on Timed Petri Nets, Torino, Italy, pp.272-278, 1985.