The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - March/April (1999 vol.25)
pp: 182-193
ABSTRACT
<p><b>Abstract</b>—The paper considers transient analysis using randomization for superposed generalized stochastic Petri nets (GSPNs). Since state space explosion implies that space is the bottleneck for numerical analysis, superposed GSPNs profit from the structured representation known for its associated Markov chain. This moves the bottleneck for analysis from space for generator matrices to space for iteration vectors. Hence a variation of randomization is presented which allows to reduce space requirements for iteration vectors. An additional and welcome side effect is that during an initial phase, this algorithm avoids useless multiplications involving states with zero probability. Furthermore, it accommodates to adaptive randomization in a natural way. Although the algorithm has been developed for superposed GSPNs, it applies to continuous time Markov chains in a more general setting.</p>
INDEX TERMS
Stochastic Petri net, Markov chain analysis, standard and adaptive randomization, Kronecker algebra.
CITATION
Peter Kemper, "Transient Analysis of Superposed GSPNs", IEEE Transactions on Software Engineering, vol.25, no. 2, pp. 182-193, March/April 1999, doi:10.1109/32.761444
28 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool