Computing bounds for the performance indices of quasi-lumpable stochastic well-formed nets

Abstract

The stochastic well-formed colored Petri net (SWN) formalism and the associated reachability graph (RG). The method for computing bounds of quasi-lumpable Markov chains is summarized. A structural analysis algorithm to check whether a given SWN is quasi-lumpable, and a modified symbolic RG (SRG) generation algorithm for the generation of the aggregate MC used for the bounds computation are described. Two application examples are shown.<>