For the most recent entries see the Petri Nets Newsletter.

Efficient approximate transient analysis for a class of deterministic and stochastic Petri nets.

Ciardo, G.; Li, G.

In: Proc. 3-rd IEEE Annual Int. Computer Performance and Dependability Symposium (IPDS'98), 7-9 September 1998, Durham, NC, pages 34-43. 1998.

Abstract: Transient analysis of non-Markovian stochastic Petri nets is a theoretically interesting and practically important problem. The paper presents a new method to compute bounds and an approximation on the average state sojourn times for a special class of deterministic and stochastic Petri nets (DSPNs). In addition to the idea of the subordinated Markov chain traditionally used for the stationary solution of DSPNs, the proposed algorithm makes use of concepts from renewal theory. An application to a finite-capacity queue with a server subject to breakdowns is included.

Keywords: deterministic Petri nets, stochastic Petri nets, transient analysis.

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography