In: 5th International Workshop on Petri Nets and Performance Models, Toulouse (F) 19.-22. October 1993, pages 98-107. 1993.
Abstract: In this paper we show that the steady state probability distribution of SPNs with product form solution can be efficiently computed using an algorithm whose space and time complexities are polynomial in the number of places and in the number of tokens in the initial marking of the SPN. Basic of the derivation of such an algorithm is a product form solution criterion proposed by Coleman, Henderson, and Taylor. The algorithm relies on the derivation of a recursive expression of normalization constant that is a generalization of that derived by Buzen for multiple class product form queueing networks with load independent service centers.
Back to the Petri Nets Bibliography