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.
Back to the Petri Nets Bibliography