This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Modeling Framework to Implement Preemption Policies in Non-Markovian SPNs
January 2000 (vol. 26 no. 1)
pp. 36-54

Abstract—Petri nets represent a useful tool for performance, dependability, and performability analysis of complex systems. Their modeling power can be increased even more if nonexponentially distributed events are considered. However, the inclusion of nonexponential distributions destroys the memoryless property and requires to specify how the marking process is conditioned upon its past history. In this paper, we consider, in particular, the class of stochastic Petri nets whose marking process can be mapped into a Markov regenerative process. An adequate mathematical framework is developed to deal with the considered class of Markov Regenerative Stochastic Petri Nets (MRSPN). An unified approach for the solution of MRSPNs where different preemption policies can be defined in the same model is presented. The solution is provided both in steady-state and in transient condition. An example concludes the paper.

[1] M.A. Marsan, G. Balbo, A. Bobbio, G. Chiola, G. Conte, and A. Cumani, “The Effect of Execution Policies on the Semantics and Analysis of Stochastic Petri Nets,” IEEE Trans. Software Eng., vol. 15, pp. 832-846, 1989.
[2] A. Bobbio, V.G. Kulkarni, A. Puliafito, M. Telek, and K. Trivedi, “Preemptive Repeat Identical Transitions in Markov Regenerative Stochastic Petri Nets,” Proc. Sixth Int'l Conf. Petri Nets and Performance Models—PNPM '95, pp. 113-122, 1995.
[3] A. Bobbio and M. Telekt, “Combined Preemption Policies in MRSPN,” R. Mittal et al. ed., Fault Tolerant Systems and Software, pp. 92-98, Narosa Publishing House, New Dehli, India, 1995.
[4] A. Bobbio and M. Telek, “Markov Regenerative SPN with Nonoverlapping Activity Cycles,” Proc. Int'l Computer Performance and Dependability Symp.—IPDS '95, pp. 124-133, 1995.
[5] A. Bobbio and M. Telek, “Transient Analysis of a Preemptive Resume M/D/1/2/2 through Petri Net Model,” Periodica Polytechnica, Ser. El. Eng., vol. 41, pp. 123-146, 1997.
[6] H. Choi, V.G. Kulkarni, and K. Trivedi, “Transient Analysis of Deterministic and Stochastic Petri Nets,” Proc. 14th Int'l Conf. Application and Theory of Petri Nets, Chicago, June 1993.
[7] H. Choi, V.G. Kulkarni, and K. Trivedi, “Markov Regenerative Stochastic Petri Nets,” Performance Evaluation, vol. 20, pp. 337-357, 1994.
[8] G. Ciardo, “Discrete-Time Markovian Stochastic Petri Nets,” Proc. Second Int'l Workshop Numerical Solution of Markov Chains,” pp. 339-358, 1995.
[9] G. Ciardo, R. German, and C. Lindemann, “A Characterization of the Stochastic Process Underlying a Stochastic Petri Net,” IEEE Trans. Software Eng., vol. 20, pp. 506–515, 1994.
[10] G. Ciardo and R. Zijal, “Well-Defined Stochastic Petri Nets,” Proc. Fourth Int'l Workshop Modeling Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS'96), pp. 278–284. IEEE CS Press 1996.
[11] E. Cinlar, Introduction to Stochastic Processes. Prentice Hall, Englewood Cliffs, 1975.
[12] D.R. Cox, “The Analysis of Non-Markovian Stochastic Processes by the Inclusion of Supplementary Variables,” Proc. Cambridge Phylosophical Soc., vol. 51, pp. 433-440, 1955.
[13] A. Cumani, “Esp—A Package for the Evaluation of Stochastic Petri Nets with Phase-Type Distributed Transition Times,” Proc. Int'l Workshop Timed Petri Nets, pp. 144-151, Torino, Italy, IEEE CS Press, no. 674, 1985.
[14] J. B. Dugan, K. S. Trivedi, R. M. Geist, and V. F. Nicola,“Extended stochastic Petri nets: Applications and analysis,”inPerformance '84, E. Gelenbe, Ed. Amsterdam, The Netherlands: North-Holland, 1984, pp. 507–519.
[15] R. German, “New Results for the Analysis of Deterministic and Stochastic Petri Nets,” Proc. Int'l Computer Performance and Dependability Symp.—(IPDS '95), pp. 114-123, 1995.
[16] R. German, “Transient Analysis of Deterministic and Stochastic Petri Nets by the Method of Supplementary Variables,” MASCOT'95, pp. 394-398, 1995.
[17] R. German, C. Kelling, A. Zimmermann, and G. Hommel, “TimeNET—A Toolkit for Evaluating Non-Markovian StochasticPetri Nets,” Performance Evaluation, vol. 24, pp. 69-87, 1995.
[18] R. German and C. Lindemann, “Analysis of Stochastic Petri Nets by the Method of Supplementary Variables,” Performance Evaluation, vol. 20, pp. 317-335, 1994.
[19] R. German, D. Logothetis, and K. Trivedi, “Transient Analysis of Markov Regenerative Stochastic Petri Nets: A Comparison of Approaches,” Proc. Sixth Int'l Conf. Petri Nets and Performance Models, PNPM'95, pp. 103-112, IEEE Computer Society, 1995.
[20] W.K. Grassmann,“The GI/PH/1 Queue: A Method to Find the Transition Matrix,”INFOR, vol. 20, pp. 144-156, 1982.
[21] P.J. Haas and G.S. Shedler,“Regenerative Stochastic Petri Nets,” Performance Evaluation, vol. 6, pp. 189-204, 1986.
[22] B.R. Haverkort and K. Trivedi,“Specification Techniques for Markov Reward Models,” Discrete Event Dynamic Systems: Theory and Applications, vol. 3, pp. 219-247, 1993.
[23] A. Heindl and R. German, “A Fourth-Order Algorithm with Automatic Stepsize Control for the Transient Analysis of DSPNs,” Proc. Seventh Int'l Conf. Petri Nets and Performance Models—(PNPM '97), pp. 60-69, 1997.
[24] M. A. Holliday and M. K. Vernon,“A generalized timed Petri net model for performance analysis,”IEEE Trans. Software Eng., vol. SE-13, pp. 1297–1310, Dec. 1987.
[25] D.L. Jagerman, “An Inversion Technique for the Laplace Transform,” The Bell System Technical J., vol. 61, pp. 1,995-2,002, Oct. 1982.
[26] V.G. Kulkarni, Modeling and Analysis of Stochastic Systems. Chapman&Hall, 1995.
[27] C. Lindemann, “An Improved Numerical Algorithm for Calculating Steady-State Solutions of Deterministic and Stochastic Petri Net Models,” Performance Evaluation, vol. 18, pp. 75-95, 1993.
[28] C. Lindemann, “DSPN Express: A Software Package for the Efficient Solution of Deterministic and Stochastic Petri Nets, Performance Evaluation, vol. 22, pp. 3-21, 1995
[29] M.K. Molloy, “Discrete Time Stochastic Petri Nets,” IEEE Trans. Software Eng., vol. 11, pp. 417-423, 1985.
[30] W.H. Press, S.A. Teukolsky, W.T. Vetterling, and B.P. Flannery, Numerical Recipes in C. Cambridge Univ. Press, 1992.
[31] A. Reibman and K.S. Trivedi, “Numerical Transient Analysis of Markov Models,” Computers and Operations Research, vol. 15, pp. 19-36, 1988.
[32] A. Reibman and K.S. Trivedi, “Transient Analysis of Cumulative Measures of Markov Chain Behavior,” Stochastic Models, vol. 5, pp. 683-710, 1989.
[33] M. Telek and A. Bobbio, “Markov Regenerative Stochastic Petri Nets with Age Type General Transitions,” G. De Michelis and M. Diaz eds., Proc. 16th Int'l Conf. Application and Theory of Petri Nets, Lecture Notes in Computer Science, vol. 935, pp. 471-489, Springer-Verlag, 1995.
[34] M. Telek, A. Bobbio, L. Jereb, A. Puliafito, and K. Trivedi, “Steady State Analysis of Markov Regenerative SPN with Age Memory Policy,” Proc. Eighth Int'l Conf. Modeling Techniques and Tools for Computer Performance Evaluation, H. Beilner and F. Bause, eds., vol. 977, pp. 165-179, 1995.
[35] M. Telek, A. Bobbio, and A. Puliafito, "Steady State Solution of MRSPN with Mixed Preemption Policies," Proc. IEEE Int'l Computer Performance and Dependability Symp., IPDS'96, pp. 106-115,Urbana-Champaign, Ill., IEEE CS Press, Sept. 1996..

Index Terms:
Stochastic Petri Nets, Markov regenerative processes, preemptive policies, transient and steady-state analysis.
Citation:
Andrea Bobbio, Antonio Puliafito, Miklós Telek, "A Modeling Framework to Implement Preemption Policies in Non-Markovian SPNs," IEEE Transactions on Software Engineering, vol. 26, no. 1, pp. 36-54, Jan. 2000, doi:10.1109/32.825765
Usage of this product signifies your acceptance of the Terms of Use.