Modified M-timed Petri nets in modelling and performance evaluation of
systems
Zuberek, W.M.
Proc. ACM 15-th Annual Computer Science Conference (CSC'87);
St.Louis, MO, February 1987, pp.261-268.
Abstract:
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.
Keywords:
Timed Petri nets, inhibitor nets, state graphs, 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.
-
J.P. Buzen, "Fundamental operational laws of computer system
performance"; Acta Informatica, vol.7, no.2, pp.167-182, 1976.
-
D. Ferrari, Computer systems performance evaluation;
Prentice-Hall 1978.
-
E. Gelenbe, I. Mitrani, Analysis and synthesis of computer systems;
Academic Press 1980.
-
C. Girault, W. Reisig (eds.), Application and theory of Petri nets
(Informatik-Fachberichte 52); Springer-Verlag 1982.
-
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 1982.
-
L. Kleinrock, Queueing systems, vol.1: "Theory",
vol.2: "Computer applications"; J. Wiley & Sons 1975, 1976.
-
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 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.
-
14. J. Sifakis, "Use of Petri nets for performance evaluation"; in
Measuring, modelling and evaluating computer systems, pp.75-93,
North-Holland 1977.
-
J. Sifakis, "Performance evaluation of systems using nets";
in Net Theory and Applications, W.Brauer (ed.), (Lecture Notes
in Computer Science 84), pp.307-319, Springer-Verlag 1980.
-
W.M. Zuberek,
"Timed Petri nets and preliminary performance evaluation";
Proc. IEEE 7-th Annual Symp. on Computer Architecture, La Baule, France,
pp.88-96, 1980.
-
W.M. Zuberek,
"Performance evaluation using extended timed Petri nets";
Proc. Int. Workshop on Timed Petri Nets, Torino, Italy, pp.37-42, 1985.
-
W.M. Zuberek,
"Generalized M-timed Petri nets and performance evaluation of computer
systems"; INFOR Journal, vol.23, no.3, pp.344-362, 1985.
-
W.M. Zuberek,
"M-timed Petri nets, Priorities, preemptions, and performance evaluation
of systems"; in Advances in Petri Nets 1985 (Lecture Notes in
Computer Science 222), G. Rozenberg (ed.), pp.478-498, Springer-Verlag 1986.
-
W.M. Zuberek,
"On modelling and evaluation of multiprocessor systems using extended
M-timed Petri nets"; Technical Report #8605,
Department of Computer Science, Memorial University of Newfoundland,
St. John's, Canada A1C 5S7, 1986.