Implicit GSPN reachability set generation using decision diagrams

Performance Evaluation

Volumn 56, Issue 1-4, 2004, Pages 145-165

  Miner, Andrew S ^a  

^a Iowa State University   (United States)

Author keywords

Decision diagrams; GSPN reachability; Matrix diagrams

Indexed keywords

ALGORITHMS; BOUNDARY VALUE PROBLEMS; COMPUTATIONAL METHODS; DATA STRUCTURES; DECISION THEORY; PROBLEM SOLVING; RANDOM PROCESSES; SET THEORY;

DECISION DIAGRAMS; GENERALIZED STOCHASTIC PETRI NET (GSPN); GSPN REACHABILITY; MATRIX DIAGRAMS; MULTI-VALUED DECISION DIAGRAMS (MDD); SET GENERATION TECHNIQUES;

QUEUEING NETWORKS;

EID: 1042288832     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.peva.2003.07.005     Document Type: Conference Paper

References (27)

1. Ajmone Marsan M., Balbo G., Conte G., A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems. ACM Trans. Comput. Syst. 2(2):1984;93-122.
2. M. Ajmone Marsan, S. Donatelli, F. Neri, A. Scalia, Approximate GSPN analysis of multiserver polling systems, in: Proceedings of the International Conference on Telecommunication, Distribution and Parallelism (TDP'96), La Londe Les Maures, France, June 1996.
3. G. Balbo, G. Chiola, G. Franceschinis, G. Molinari Roet, On the efficient construction of the tangible reachability graph of generalized stochastic Petri nets, in: Proceedings of the Second International Workshop on Petri Nets and Performance Models (PNPM'87), Madison, WI, IEEE Comp. Soc. Press, August 1987, pp. 136-145.
4. A. Blakemore, The cost of eliminating vanishing markings from generalized stochastic Petri nets, in: Proceedings of the Third International Workshop on Petri Nets and Performance Models (PNPM'89), Kyoto, Japan, IEEE Comp. Soc. Press, December 1989, pp. 85-92.
5. K.S. Brace, R.L. Rudell, R.E. Bryant, Efficient implementation of a BDD package, in: Proceedings of the 27th ACM/IEEE Design Automation Conference, ACM Press, New York, 1990, pp. 40-45.
6. Bryant R.E., Graph-based algorithms for boolean function manipulation. IEEE Trans. Comput. C. 35(8):1986;677-691.
7. Buchholz P., Ciardo G., Donatelli S., Kemper P., Complexity of memory-efficient Kronecker operations with applications to the solution of Markov models. INFORMS J. Comput. 12(3):2000;203-222.
8. 20 states and beyond Inform. Comput. 98(2):1992;142-170.
9. G. Chiola, Compiling techniques for the analysis of stochastic Petri nets, in: Proceedings of the Fourth International Conference on Modelling Techniques and Tools for Performance Evaluation, 1989, pp. 13-27.
10. Chiola G., Ajmone Marsan M., Balbo G., Conte G., Generalized stochastic Petri nets: a definition at the net level and its implications. IEEE Trans. Softw. Eng. 19(2):1993;89-107.
11. G. Ciardo, Discrete-time Markovian stochastic Petri nets, in: W.J. Stewart (Ed.), Computations with Markov Chains, Kluwer Academic Publishers, Boston, MA, 1995, pp. 339-358.
12. G. Ciardo, G. Luettgen, R. Siminiceanu, Saturation: an efficient iteration strategy for symbolic state space generation, in: T. Margaria, W. Yi (Eds.), Proc. Tools and Algorithms for the Construction and Analysis of Systems (TACAS), Genova, Italy, Lecture Notes in Computer Science, vol. 2031, Springer, Berlin, April 2001, pp. 328-342.
13. G. Ciardo, R. Marmorstein, R. Siminiceanu, Saturation unbound, in: Proc. Tools and Algorithms for the Construction and Analysis of Systems (TACAS), Warsaw, Poland, Lecture Notes in Computer Science, vol. 2619, Springer, Berlin, April 2003, pp. 379-393.
14. G. Ciardo, A.S. Miner, SMART: simulation and Markovian analyzer for reliability and timing, in: Proceedings of the IEEE International Computer Performance and Dependability Symposium (IPDS'96), Urbana-Champaign, IL, USA, IEEE Comp. Soc. Press, September 1996, p. 60.
15. G. Ciardo, A.S. Miner, Storage alternatives for large structured state spaces, in: R. Marie, B. Plateau, M. Calzarossa, G. Rubino (Eds.), Proceedings of the Ninth International Conference on Modelling Techniques and Tools for Computer Performance Evaluation, Saint Malo, France, Lecture Notes in Computer Science, vol. 1245, Springer, Berlin, June 1997, pp. 44-57.
16. G. Ciardo, A.S. Miner, A data structure for the efficient Kronecker solution of GSPNs, in: P. Buchholz (Ed.), Proceedings of the Eighth International Workshop on Petri Nets and Performance Models (PNPM'99), Zaragoza, Spain, IEEE Comp. Soc. Press, September 1999, pp. 22-31.
17. G. Ciardo, 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.
18. Ciardo G., Trivedi K.S., A decomposition approach for stochastic reward net models. Perform. Eval. 18(1):1993;37-59.
19. Donatelli S., Kemper P., Integrating synchronization with priority into a Kronecker representation. Perform. Eval. 44(1-4):2001;73-96.
20. B. Haverkort, A. Bell, H. Bohnenkamp, On the efficient sequential and distributed generation of very large Markov chains from stochastic Petri nets, in: P. Buchholz (Ed.), Proceedings of the Eighth International Workshop on Petri Nets and Performance Models (PNPM'99), Zaragoza, Spain, IEEE Comp. Soc. Press, September 1999, pp. 12-21.
21. H. Hermanns, M. Kwiatkowska, G. Norman, D. Parker, M. Siegle, On the use of MTBDDs for performability analysis and verification of stochastic systems, J. Logic Algebr. Program. (Special Issue on Probabilistic Techniques for the Design and Analysis of Systems) 56 (1-2) (2003) 23-67.
22. Kam T., Villa T., Brayton R., Sangiovanni-Vincentelli A., Multi-valued decision diagrams: theory and applications. Mult.-Valued Logic. 4(1-2):1998;9-62.
23. Kemper P., Numerical analysis of superposed GSPNs. IEEE Trans. Softw. Eng. 22(9):1996;615-628.
24. Y. Matsunaga, P.C. McGeer, R.K. Brayton, On computing the transitive closure of a state transition relation, in: Proceedings of the 30th International Design Automation Conference, ACM Press, New York, 1993, pp. 260-265.
25. A.S. Miner, Efficient solution of GSPNs using canonical matrix diagrams, in: R. German, B. Haverkort (Eds.), Proceedings of the Ninth International Workshop on Petri Nets and Performance Models (PNPM'01), Aachen, Germany, IEEE Comp. Soc. Press, September 2001, pp. 101-110.
26. A.S. Miner, G. Ciardo, Efficient reachability set generation and storage using decision diagrams, in: H. Kleijn, S. Donatelli (Eds.), Proceedings of the 20th International Conference on Applications and Theory of Petri Nets, Williamsburg, VA, USA, Lecture Notes in Computer Science, vol. 1639, Springer, Berlin, June 1999, pp. 6-25.
27. E. Pastor, O. Roig, J. Cortadella, R. Badia, Petri net analysis using boolean manipulation, in: R. Valette (Ed.), Proceedings of the 15th International Conference on Applications and Theory of Petri Nets, Zaragoza, Spain, Lecture Notes in Computer Science, vol. 815, Springer, Berlin, June 1994, pp. 416-435.