Symbolic state-space exploration and numerical analysis of state-sharing composed models

Linear Algebra and Its Applications

Volumn 386, Issue 1-3 SUPPL., 2004, Pages 137-166

  Derisavi, Salem ^a   Kemper, Peter ^b   Sanders, William H ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Matrix diagrams; Multi valued decision diagrams; Numerical analysis; Symbolic state space exploration

Indexed keywords

COMPUTATION THEORY; COMPUTER SIMULATION; DECISION THEORY; HIERARCHICAL SYSTEMS; MARKOV PROCESSES; MATHEMATICAL MODELS; MATRIX ALGEBRA;

CONGRUENCE THEORY; MATRIX DIAGRAMS; MULTI VALUED DECISION DIAGRAMS; SYMBOLIC STATE SPACE EXPLORATION;

RANDOM PROCESSES;

EID: 2942620807     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2004.01.006     Document Type: Conference Paper

References (29)

1. Bause F., Buchholz P., Kemper P. A toolbox for functional and quantitative analysis of DEDS. Proc. 10th Int. Conf. Modelling Techniques and Tools for Computer Performance Evaluation. Lecture Notes in Computer Science. vol. 1469:1998;356-359 Springer.
2. A. Benoit, L. Brenner, P. Fernandes, B. Plateau, Aggregation of stochastic automata networks with replicas, in: Proc. 4th Int. Conference on Numerical Solution of Markov Chains (NSMC), 2003, pp. 145-166.
3. Bryant R.E. Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. 35(8):1986;677-691.
4. P. Buchholz, Markovian process algebra: composition and equivalence, in Proc. 2nd Workshop on Proc. Algebras and Perf. Modelling (PAPM), 1994, pp. 11-30.
5. 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.
6. Buchholz P., Kemper P. Efficient computation and representation of large reachability sets for composed automata. Discrete Event Dyn. Syst. 12(3):2002;265-286.
7. 20 states and beyond. Inform. and Comput. 98(2):1992;142-170. June.
8. Chiola G., Dutheillet C., Franceschinis G., Haddad S. Stochastic well-formed colored nets and symmetric modeling applications. IEEE Trans. Comput. 42(11):1993;1343-1360.
9. Ciardo G., Lüttgen G., Siminiceanu R. Saturation: an efficient iteration strategy for symbolic state-space generation. TACAS 2001. LNCS. vol. 2031:2001;328-342 Springer.
10. Ciardo G., Marmorstein R.M., Siminiceanu R. Saturation unbound. TACAS 2003. LNCS. vol. 2619:2003;379-393 Springer.
11. Ciardo G., Miner A.S. Storage alternatives for large structured state spaces. Proc. 9th Int. Conf. Modelling Techniques and Tools for Computer Performance Evaluation. LNCS. vol. 1245:1997;44-57 Springer.
12. G. Ciardo, A.S. Miner, A data structure for the efficient Kronecker solution of GSPNs, in: Proc. 8th Int. Workshop Petri Nets and Performance Models, 1999, pp. 22-31.
13. Ciardo G., Miner A.S. Efficient reachability set generation and storage using decision diagrams. Proc. 20th Int. Conf. Application and Theory of Petri Nets. LNCS. vol. 1639:1999;6-25 Springer.
14. Clarke E.M., Grumberg O., Peled D. Model Checking. 1999;MIT Press.
15. Deavours D.D., Clark G., Courtney T., Daly D., Derisavi S., Doyle J.M., Sanders W.H., Webster P.G. The Möbius framework and its implementation. IEEE Trans. Soft. Eng. 28(10):2002;956-969.
16. C. Delamare, Y. Gardan, P. Moreaux, Performance evaluation with asynchronously decomposable swn: implementation and case study, in: Proc. 10th Int. Workshop on Petri Nets and Performance Models (PNPM), 2003, pp. 20-29.
17. S. Derisavi, P. Kemper, W.H. Sanders, T. Courtney, The Möbius state-level abstract functional interface, in: Proc. of the 12th Int. Conf. on Modelling Techniques and Tools for Computer Performance Evaluation (TOOLS 2002), 2002, pp. 31-50.
18. H. Hermanns, J. Kayser, M. Siegle, Multi terminal binary decision diagrams to represent and analyse continuous time Markov chains, in: Proc. of 3rd Meeting on Numerical Solution of Markov Chains (NSMC), 1999, pp. 188-207.
19. Ibaraki T., Katoh N. On-line computation of transitive closures of graphs. Inform. Process. Lett. 16:1983;95-97.
20. K. Lampka, M. Siegle, Symbolic composition within the Möbius framework, in: B. Wolfinger, K. Heidtmann (Eds.), Leistungs-, Zuverlässigkeits- und Verlässlichkeitsbewertung van Kommunikationsnetzen und verteilten Systemen. 2. MMB Arbeitsgespräch, Universität Hamburg, Fachbereich Informatik, Bericht 242, 2002, pp. 63-74.
21. D. Lee, J. Abraham, D. Rennels, G. Gilley, A numerical technique for the evaluation of large, closed fault-tolerant systems, in: Proc. 2nd Int. Conference on Dependable Computing for Critical Applications 2 (DCCA-2), 1992, pp. 95-114.
22. A.S. Miner, Efficient solution of GSPNs using canonical matrix diagrams, in: Proc. 9th Int. Workshop Petri Nets and Performance Models, 2001, pp. 101-110.
23. A.S. Miner, Computing response time distributions using stochastic Petri nets and matrix diagrams, in: Proc. 10th Int. Workshop on Petri Nets and Performance Models (PNPM), 2003, pp. 10-19.
24. B. Plateau, On the stochastic structure of parallelism and synchronisation models for distributed algorithms, in: Proc. 1985 SIGMETRICS Conf. on Measurement and Modeling of Computer Systems, 1985, pp. 147-153.
25. Sanders W.H., Malhis L.M. Dependability evaluation using composed SAN-based reward models. J. Parallel Distributed Comput. 15(3):1992;238-254. July.
26. Sanders W.H., Meyer J.F. Reduced base model construction methods for stochastic activity networks. IEEE J. Selected Areas Commun. 9(1):1991;25-36.
27. A. Srinivasan, T. Kam, S. Malik, R.E. Brayton, Algorithms for discrete function manipulation, in: Int'l Conf. on CAD, 1990, pp. 92-95.
28. Stewart W.J. Introduction to the Numerical Solution of Markov Chains. 1994;Princeton.
29. C.M. Woodside, Y. Li, Performance Petri net analysis of communications protocol software by delay-equivalent aggregation, in: Proc. of the 4th Int. Workshop on Petri Nets and Performance Models, 1991, pp. 64-73.