On the distribution of flow times of marking states in stochastic Petri nets

Summary form only given, as follows. When analysing traffic systems, often the probability distribution of certain performance measures is desired rather than their average values and higher statistical moments, respectively. Within this paper (1) a M/M/N/S1/S2/HOL queueing system is transformed into a compact generalized stochastic Petri net (GSPN) model (2) 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 (3) the application of this algorithm for the computation of the waiting time distribution of non-pr