Efficient solution of GSPNs using canonical matrix diagrams

Proceedings - 9th International Workshop on Petri Nets and Performance Models, PNPM 2001

Volumn , Issue , 2001, Pages 101-110

  Miner, Andrew S ^a  

^a Iowa State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONTINUOUS TIME SYSTEMS; MARKOV PROCESSES; MATRIX ALGEBRA; STOCHASTIC SYSTEMS;

CANONICAL MATRICES; CONTINOUS TIME MARKOV CHAIN; GENERALIZED STOCHASTIC PETRI NET MODELS; GENERALIZED STOCHASTIC PETRI NETS; KRONECKER; MATRIX DIAGRAMS; NEW FORMS; NON-NEGATIVE MATRIX; NUMERICAL SOLUTION; TRANSITION RATE MATRIX;

PETRI NETS;

EID: 84957825799     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PNPM.2001.953360     Document Type: Conference Paper

References (21)

1. P. Buchholz. Numerical solution methods based on structured descriptions of Markovian models. In G. Balbo and G. Serazzi, editors, Computer performance evaluation, pages 251-267. Elsevier Science Publishers B.V. (North-Holland), 1991.
2. P. Buchholz, G. Ciardo, S. Donatelli, and P. Kemper. Complexity of memory-efficient Kronecker operations with applications to the solution of Markov models. INFORMS J. Comp., 12(3):203-222, SUMMER 2000.
3. P. Buchholz and P. Kemper. Numerical analysis of stochastic marked graphs. In Proc. 6th Int. Workshopon Petri Nets and Performance Models (PNPM’95), pages 32-41, Durham, NC, Oct. 1995. IEEE Comp. Soc. Press.
4. G. Ciardo, G. Luettgen, and R. Siminiceanu. Saturation: an efficient iteration strategy for symbolic state space generation. In T. Margaria and W. Yi, editors, Proc. Tools and Algorithms for the Construction and Analysis of Systems (TACAS),Lecture Notes in Computer Science 2031, pages 328-342, Genova, Italy, Apr. 2001. Springer-Verlag.
5. G. Ciardo and A. S. Miner. SMART: Simulation and Markovian Analyzer for Reliability and Timing. In Proc. IEEE International Computer Performance and Dependability Symposium (IPDS’96),page 60, Urbana-Champaign, IL, USA, Sept. 1996.IEEE Comp. Soc. Press.
6. G. Ciardo and A. S. Miner. Storage alternatives for large structured state spaces. In R. Marie, B. Plateau, M. Calzarossa, and G. Rubino, editors, Proc. 9th Int. Con$ on Modelling Techniques and Tools for Computer Performance Evaluation, LNCS 1245, pages 44-57, Saint Malo, France, June 1997. Springer-Verlag.
7. G. Ciardo and A. S. Miner. A data structure for the efficient Kronecker solution of GSPNs. In P. Buchholz, editor, Proc. 8th Int. Workshop on Petri Nets and Performance Models (PNPM’99),pages 22-31, Zaragoza, Spain, Sept. 1999. IEEE Comp. Soc. Press.
8. G. Ciardo and M. Tilgner. On the use of Kronecker operators for the solution of generalized stochastic Petri nets. ICASE Report 96-35, Institute for Computer Applications in Science and Engineering, Hampton, VA, May 1996.
9. G. Ciardo and K. S. Trivedi. A decomposition approach for stochastic reward net models. Performance Evaluation, 18(1):37-59, 1993.
10. D. D. Deavours and W.H. Sanders. An efficient disk-based tool for solving very large Markov models. In R. Marie, B. Plateau, M. Calzarossa, and G. Rubino, editors, Proc. 9th Int. Con$ on Modelling Techniques and Toolsfor Computer Performance Evaluation, LNCS 1245, pages 58-71, Saint Malo, France, June 1997. Springer-Verlag.
11. D. D. Deavours and W. H. Sanders. “On-the-fly’’ solution techniques for stochastic Petri nets and extensions. In Proc. 7th Int. Workshop on Petri Nets and Performance Models (PNPM’97),pages 132-141, Saint Malo, France, June 1997. IEEE Comp. Soc. Press.
12. S. Donatelli. Superposed generalized stochastic Petri nets: definition and efficient solution. In R. Valette, editor, Application and Theory of Petri Nets 1994 (Proc. 15th Int. Con$ on Applications and Theory of Petri Nets), Lecture Notes in Computer Science 815, pages 258-277, Zaragoza, Spain, June 1994. Springer-Verlag.
13. P. Femandes, B. Plateau, and W. J. Stewart. Efficient descriptor-vector multiplication in stochastic automata networks. Journal of the ACM, 45(3):381-414, 1998.
14. H. Hermanns, J. Kayser, and M. Siegle. Multi terminal binary decision diagrams to represent and analyse continuous time Markov chains. In B. Plateau, W. J. Stewart, and M. Silva, editors, Numerical Solution of Markov Chains, pages 188-207, Zaragoza, Spain, June 1999. Prensas Universitarias de Zaragoza.
15. P. Kemper. Numerical analysis of superposed GSPNs. IEEE Transactions on Software Engineering, 22(4):615-628, Sept. 1996.
16. M. A. Marsan, G. Balbo, G. Conte, S. Donatelli, and G. Franceschinis. Modelling with generalized stochastic Petri nets. John Wiley & Sons, 1995.
17. J. F. Meyer, A. Movaghar, and W. H. Sanders. Stochastic activity networks: structure, behavior, and application. In Proc. Int. Workshop on Timed Petri Nets, Torino, Italy, July 1985.
18. A. S. Miner and G. Ciardo. Efficient reachability set generation and storage using decision diagrams. In H. Kleijn and S. Donatelli, editors, Application and Theory of Petri Nets 1999 (Proc. 20th Int. Conf on Applications and Theory of Petri Nets, Williamsburg, VA, USA),Lecture Notes in Computer Science 1639, pages 6-25. Springer-Verlag, June 1999.
19. J. K. Muppala, G. Ciardo, and K. S. Trivedi. Modeling using Stochastic Reward Nets. In Proc. 1st Int. Workshopon Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS’93),pages 367-372, San Diego, CA, USA, Jan. 1993. IEEE Comp. Soc. Press.
20. B. Plateau. On the stochastic structure of parallelism and synchronisation models for distributed algorithms. In Proc. 1985 ACM SIGMETRICS Con$ on Measurement and Modeling of Computer Systems, pages 147-153, Austin, TX, USA, May 1985.
21. A. Srinivasan, T. Kam, S. Malik, and R. K. Brayton. Algorithms for discrete function manipulation. In International Conference on CAD, pages 92-95. IEEE Computer Society, 1990.