Transient analysis of deterministic and stochastic Petri nets

  • Hoon Choi
  • Vidyadhar G. Kulkarni
  • Kishor S. Trivedi
Full Papers

DOI: 10.1007/3-540-56863-8_46

Part of the Lecture Notes in Computer Science book series (LNCS, volume 691)
Cite this paper as:
Choi H., Kulkarni V.G., Trivedi K.S. (1993) Transient analysis of deterministic and stochastic Petri nets. In: Ajmone Marsan M. (eds) Application and Theory of Petri Nets 1993. ICATPN 1993. Lecture Notes in Computer Science, vol 691. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 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