In: Proceedings of 9th International Workshop on Petri Nets and Performance Models, PNPM'01 Aachen, Sept. 11-14 , 2001, Reinhard German and Boudewijn Haverkort (eds.), IEEE, pages 71-80. 2001.
Abstract: We show that a particular class of Generalized Stochastic Petri Nets have stationary probabilities that exhibit a product-form. Efficient solution algorithms can be developed for the computation of the performance indices of such Product-Form GSPNs. These algorithms avoid the generation of the underlying state space. Hence, large PF-GSPN models can now be effectively studied.
Back to the Petri Nets Bibliography