Advertisement

Markov Regenerative Stochastic Petri Nets with age type general transitions

  • Miklós Telek
  • Andrea Bobbio
Full Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 935)

Abstract

Markov Regenerative Stochastic Petri Nets (MRSPN) have been recently introduced in the literature with the aim of combining exponential and non-exponential firing times into a single model. However, the realizations of the general MRSPN model, so far discussed, require that at most a single non-exponential transition is enabled in each marking and that its associated memory policy is of enabling type. The present paper extends the previous models by allowing the memory policy to be of age type and by allowing multiple general transitions to be simultaneously enabled, provided that their enabling intervals do not overlap. A final completely developed example, that couldn't have been considered in previous formulations, derives the closed form expressions for the transient state probabilities for a queueing system with preemptive resume (prs) service policy.

Key words

Markov regenerative processes Stochastic Petri Nets Queueing systems with preemptive resume service Transient analysis 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    M. Ajmone 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 Transactions on Software Engineering, SE-15:832–846, 1989.CrossRefGoogle Scholar
  2. 2.
    M. Ajmone Marsan and G. Chiola. On Petri nets with deterministic and exponentially distributed firing times. In Lecture Notes in Computer Science, volume 266, pages 132–145. Springer Verlag, 1987.Google Scholar
  3. 3.
    A. Bobbio. Stochastic reward models in performance/reliability analysis. Journal on Communications, XLIII:27–35, January 1992.Google Scholar
  4. 4.
    A. Bobbio and M. Telek. Task completion time. In Proceedings 2nd International Workshop on Performability Modelling of Computer and Communication Systems (PMCCS2), 1993.Google Scholar
  5. 5.
    A. Bobbio and M. Telek. Computational restrictions for SPN with generally distributed transition times. In D. Hammer K. Echtle and D. Powell, editors, First European Dependable Computing Conference (EDCC-1), Lecture Notes in Computer Science, volume 852, pages 131–148, 1994.Google Scholar
  6. 6.
    A. Bobbio and M. Telek. Markov regenerative SPN with non-overlapping activity cycles. In International Computer Performance and Dependability Symposium — IPDS95, April 1995.Google Scholar
  7. 7.
    Hoon Choi, V.G. Kulkarni, and K. Trivedi. Transient analysis of deterministic and stochastic Petri nets. In Proceedings of the 14-th International Conference on Application and Theory of Petri Nets, Chicago, June 1993.Google Scholar
  8. 8.
    Hoon Choi, V.G. Kulkarni, and K. Trivedi. Markov regenerative stochastic Petri nets. Performance Evaluation, 20:337–357, 1994.Google Scholar
  9. 9.
    G. Ciardo, R. German, and C. Lindemann. A characterization of the stochastic process underlying a stochastic Petri net. IEEE Transactions on Software Engineering, 20:506–515, 1994.Google Scholar
  10. 10.
    G. Ciardo and C. Lindemann. Analysis of deterministic and stochastic Petri nets. In Proceedings International Workshop on Petri Nets and Performance Models — PNPM93, pages 160–169. IEEE Computer Society, 1993.Google Scholar
  11. 11.
    E. Cinlar. Introduction to Stochastic Processes. Prentice-Hall, Englewood Cliffs, 1975.Google Scholar
  12. 12.
    A. Cumani. Esp — A package for the evaluation of stochastic Petri nets with phase-type distributed transition times. In Proceedings International Workshop Timed Petri Nets, pages 144–151, Torino (Italy), 1985. IEEE Computer Society Press no. 674.Google Scholar
  13. 13.
    R. German and C. Lindemann. Analysis of stochastic Petri nets by the method of supplementary variables. Performance Evaluation, 20:317–335, 1994.Google Scholar
  14. 14.
    D.L. Jagerman. An inversion technique for the Laplace transform. The Bell System Technical Journal, 61:1995–2002, October 1982.Google Scholar
  15. 15.
    V.G. Kulkarni, V.F. Nicola, and K. Trivedi. On modeling the performance and reliability of multi-mode computer systems. The Journal of Systems and Software, 6:175–183, 1986.Google Scholar
  16. 16.
    C. Lindemann. An improved numerical algorithm for calculating steady-state solutions of deterministic and stochastic Petri net models. Performance Evaluation, 18:75–95, 1993.Google Scholar
  17. 17.
    A. Reibman, R. Smith, and K.S. Trivedi. Markov and Markov reward model transient analysis: an overview of numerical approaches. European Journal of Operational Research, 40:257–267, 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Miklós Telek
    • 1
  • Andrea Bobbio
    • 2
  1. 1.Department of TelecommunicationsTechnical University of BudapestBudapestHungary
  2. 2.Dipartimento di Elettronica per l'AutomazioneUniversità di BresciaBresciaItaly

Personalised recommendations