For the most recent entries see the Petri Nets Newsletter.

On the Computation of Flow and Cycle Time Distributions of Marking States in Stochastic Petri Nets.

Giglmayr, J.

In: NTZ Archiv, Vol. 10, No. 12, pages 339-349. 1988.

Abstract: In this paper a special queuing system is transformed into a compact generalized stochastic Petri net model, and an algorithm which considers the existence of cycles within the reachability graph of the net is presented for the exact computation of the probability distribution of the flow times of marking states. These results are extended to the distribution of recurrence (cycle) times of marking states.

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

Back to the Petri Nets Bibliography