In: Performance Evaluation Review, Vol. 16, No. 1, pages 1-278 pp.. May 1988.
Abstract: When analysing traffic systems, often the probability distribution of certain performance measures is desired. In this paper a queueing system is transformed into a compact generalized stochastic Petri net (GSPN) model and an algorithm which consider the existence of cycles within the reachability graph of the GSPN is presented for the computation of the probability distribution of the flow time of marking states.
Back to the Petri Nets Bibliography