A data structure for the efficient Kronecker solution of GSPNs
- 20 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636714,p. 22-31
- https://doi.org/10.1109/pnpm.1999.796529
Abstract
Kronecker-based approaches have been proposed for the solution of structured GSPNs with extremely large state spaces. Representing the transition rate matrix using Kronecker sums and products of smaller matrices virtually eliminates its storage requirements, but introduces various sources of overhead. We show how, by using a new data structure which we call matrix diagrams, we are able to greatly reduce or eliminate many of these overheads, resulting in a very efficient overall solution process.Keywords
This publication has 13 references indexed in Scilit:
- Algorithms for discrete function manipulationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- "On-the-fly" solution techniques for stochastic Petri nets and extensionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Numerical analysis of stochastic marked graph netsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- An efficient disk-based tool for solving very large Markov modelsPublished by Springer Nature ,1997
- Storage alternatives for large structured state spacesPublished by Springer Nature ,1997
- Numerical analysis of superposed GSPNsIEEE Transactions on Software Engineering, 1996
- Superposed stochastic automata: a class of stochastic Petri nets with parallel solution and distributed state spacePerformance Evaluation, 1993
- Symbolic Boolean manipulation with ordered binary-decision diagramsACM Computing Surveys, 1992
- Reduced base model construction methods for stochastic activity networksIEEE Journal on Selected Areas in Communications, 1991
- On the stochastic structure of parallelism and synchronization models for distributed algorithmsPublished by Association for Computing Machinery (ACM) ,1985