Performance evaluation using extended timed Petri nets

Zuberek, W.M.

Proc. Int. Workshop on Timed Petri Nets; Torino, Italy, 1-3 July 1985, pp.272-278.

Abstract:

It is shown that the behavior of extended limited-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 homogenous 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. A simple model of an interactive computer system with priority scheduling is used as an illustration of performance evaluation, and a short comparison of timed Petri nets with stochastic Petri nets is given.

Keywords:

Timed Petri nets, reachability analysis, Markov chains, performance analysis.

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 Trans. 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.
• E. Gelenbe, I. Mitrani, Analysis and synthesis of computer systems; Academic Press 1980.
• M. Jantzen, R. Valk, "Formal properties of place/transition nets"; in Net Theory and Applications, W. Brauer (ed.), Lecture Notes in Computer Science 84, pp.165-212, Springer-Verlag 1980.
• 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 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, pp.75-93, North-Holland 1977.
• 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, "M-timed Petri nets, modelling and performance evaluation of systems"; Technical Report #8503, Department of Computer Science, Memorial University of Newfoundland, St. John's, Canada A1C 5S7, 1985.