Abstract: Stochastic Petri nets of various types (SPN, GSPN, ESPN, DSPN etc.) are recognized as useful modeling tools for analyzing the performance and reliability of systems. The analysis of such Petri nets proceeds by utilizing the underlying continuous-time stochastic processes — continuous-time Markov chains for SPN and GSPN, semi-Markov processes for a subset of ESPNs and Markov regenerative processes for DSPN. In this paper, we introduce a new class of stochastic Petri nets, called Markov Regenerative Stochastic Petri Nets (MRSPNs), that can be analyzed by means of Markov regenerative processes and constitutes a true generalization of all the above classes. The MRSPNs allow immediate transitions, exponentially distributed timed transitions and generally distributed timed transitions. With a restriction that at most one generally distributed timed transition be enabled in each marking, the transient and steady state analysis of MRSPNs can be carried out analytically-numerically rather than by simulation. Equations for the solution of MRSPNs are developed in this paper, and are applied to an example.
Publication Year: 1994
Publication Date: 1994-05-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 270
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot