A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is
Stationary analysis of Generalized Stochastic Petri Nets (GSPNs) often suffers from the state space explosion problem. Large reachability sets -isomorphic to continuous-time Markov chains -are not only expensive to generate, but related high-dimensional data structures also put excessive demands on numerical algorithms. In particular sequences of transitions and alternative branches, which -if enabled concurrentlycontribute multiplicatively to the size of the state space. This paper examinesdoi:10.1109/mascot.2002.1167079 dblp:conf/mascots/FreiheitH02 fatcat:knxq5dmy75a43bp57drurxddme