In: Proceedings of the Seventh International Workshop on Petri Nets and Performance Models, June 3-6, 1997, Saint Malo, France, pages 101-110. Los Alamitos, California: IEEE Computer Society, June 1997.
Also in: IEEE Transactions on Software Engineering, Volume 25, Issue 2, pages 182-193. IEEE Press, March 1999.
Abstract: 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 matarices 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.
Keywords: Stochastic Petri net; Markov chain analysis; standard and adaptive randomization; Kronecker algebra..