Algorithms for product-form stochastic Petri nets-A new approach

Abstract

A general relationship between utilizations in product-form stochastic Petri nets (PF-SPNs) is used to derive a method for calculating the normalizing constant. The method collects the contributions of many states together as geometric sums and in general provides a recursive algorithm with numerical complexity independent of the size of the initial marking. The technique is applied to some simple examples, and closed-form solutions are obtained for the normalizing constant.<>