Transient analysis of deterministic and stochastic Petri nets

  • Hoon Choi
  • Vidyadhar G. Kulkarni
  • Kishor S. Trivedi
Full Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 691)


Deterministic and stochastic Petri nets (DSPNs) are recognized as a useful modeling technique because of their capability to represent constant delays which appear in many practical systems. If at most one deterministic transition is allowed to be enabled in each marking, the state probabilities of a DSPN can be obtained analytically rather than by simulation. We show that the continuous time stochastic process underlying the DSPN with this condition is a Markov regenerative process and develop a method for computing the transient (time dependent) behavior. We also provide a steady state solution method using Markov regenerative process theory and show that it is consistent with the method of Ajmone Marsan and Chiola.


Transient Analysis Steady State Probability Firing Time Reachability Graph Deterministic Transition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    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
  2. [2]
    M. Ajmone-Marsan, G. Conte, and G. Balbo. A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems. ACM Transactions on Computer Systems, 2(2):93–122, May 1984.Google Scholar
  3. [3]
    E. Çinlar. Introduction to Stochastic Processes. Prentice-Hall, Englewood Cliffs, U.S.A., 1975.Google Scholar
  4. [4]
    P. F. Chimento and K. S. Trivedi. The completion time of programs on processors subject to failure and repair. IEEE Transactions on Computers, To appear.Google Scholar
  5. [5]
    H. Choi, V. G. Kulkarni, and K. S. Trivedi. Markov Regenerative Stochastic Petri Nets. Technical Report DUKE-CCSR-93-001, Center for Computer Systems Research, Duke University, 1993.Google Scholar
  6. [6]
    H. Choi, V. Mainkar, and K. S. Trivedi. Sensitivity analysis of deterministic and stochastic Petri nets. In Proceedings of MASCOTS'93, the International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, San Diego, USA, Jan 1993.Google Scholar
  7. [7]
    J. B. Dugan, K. S. Trivedi, R. M. Geist, and V. F. Nicola. Extended stochastic Petri nets: Applications and analysis. In E. Gelenbe, editor, Performance '84, pages 507–519. Elsevier Science Publishers B. V. (North-Holland), Amsterdam, Netherlands, 1985.Google Scholar
  8. [8]
    R. M. Geist, M. K. Smotherman, K. S. Trivedi, and J. B. Dugan. The reliability of life-critical systems. Acta Informatica, 23:621–642, 1986.Google Scholar
  9. [9]
    P. J. Haas and G. S. Shedler. Stochastic Petri nets with timed and immediate transitions. Communications in Statistics-Stochastic Models, 5(4):563–600, 1989.Google Scholar
  10. [10]
    D. L. Jagerman. An inversion technique for the Laplace Transforms. Bell System Technical Journal, 61(8):1995–2002, Sep. 1982.Google Scholar
  11. [11]
    V. G. Kulkarni. Lecture Notes on Stochastic Models in Operations Research. University of North Carolina, Chapel Hill, U.S.A., 1990.Google Scholar
  12. [12]
    C. Lindemann. An improved numerical algorithm for calculating steady-state solutions of deterministic and stochastic Petri net models. In Proceedings of the 4th International Workshop on Petri Nets and Performance Models, pages 176–185, Melbourne, Australia, Dec. 3–5 1991.Google Scholar
  13. [13]
    C. Lindemann and R. German. Analysis of stochastic Petri nets by the method of supplementary variables. Technical Report 1992-43, Technical University of Berlin, 1992.Google Scholar
  14. [14]
    M. K. Molloy. Performance analysis using stochastic Petri nets. IEEE Transactions on Computers, C-31(9):913–917, Sep. 1982.Google Scholar
  15. [15]
    J. K. Muppala and K. S. Trivedi. GSPN models: Sensitivity analysis and applications. In Proceedings of the 28th ACM Southeast Region Conference, pages 24–33, Apr. 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Hoon Choi
    • 1
  • Vidyadhar G. Kulkarni
    • 3
  • Kishor S. Trivedi
    • 2
  1. 1.Department of Computer ScienceDuke UniversityDurhamUSA
  2. 2.Department of Electrical EngineeringDuke UniversityDurhamUSA
  3. 3.Department of Operations ResearchUniversity of North CarolinaChapel HillUSA

Personalised recommendations