Symbolic partition refinement with dynamic balancing of time and space

Proceedings - 5th International Conference on the Quantitative Evaluation of Systems, QEST 2008

Volumn , Issue , 2008, Pages 65-74

  Wimmer, Ralf ^a   Derisavi, Salem ^b   Hermanns, Holger ^c  

^a UNIVERSITY OF FREIBURG   (Germany)

^b IBM TORONTO LAB   (Canada)

^c SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

MARKOV PROCESSES;

BISIMULATION; DYNAMIC BALANCING; EXPLICIT REPRESENTATIONS; INTERACTIVE MARKOV CHAINS; LABELED TRANSITION SYSTEMS; MARKOV CHAINS; MEMORY CONSUMPTIONS; MEMORY LIMITATIONS; NUMERICAL ALGORITHMS; PARTITION REFINEMENTS; PARTITION SIZES; STATE SPACES; SYMBOLIC ALGORITHMS; SYMBOLIC BISIMULATION;

OPTIMIZATION;

EID: 56649116054     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/QEST.2008.14     Document Type: Conference Paper

References (28)

1. I. Bahar, E. Frohm, C. Gaona, G. Hachtel, E. Macii, A. Pardo, and F. Somenzi. Algebraic decision diagrams and their applications. FMSD, 10(2/3):171-206, 1997.
2. S. Blom and S. Orzan. Distributed branching bisimulation reduction of state spaces. In Proc. of PDMC, vol. 89 of ENTCS, pp. 99-113. Elsevier, 2003.
3. S. Blom and S. Orzan. A distributed algorithm for strong bisimulation reduction of state spaces. STTT, 7(1):74-86, 2005.
4. S. Blom and S. Orzan. Distributed state space minimization. STTT, 7(3):280-291, June 2005.
5. E. Böde, M. Herbstritt, H. Hermanns, S. Johr, T. Peikenkamp, R. Pulungan, R. Wimmer, and B. Becker. Compositional performability evaluation for statemate. In Proc. of QEST, pp. 167-178, 2006.
6. A. Bouali and R. de Simone. Symbolic bisimulation minimisation. In Proc. of CAV, vol. 663 of LNCS, pp. 96-108, 1992.
7. E. Clarke, M. Fujita, P. McGeer, K. McMillan, J. Yang, and X. Zhao. Multiterminal binary decision diagrams: An efficient data structure for matrix representation. FMSD, 10(2/3):149-169, 1997.
8. E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. MIT Press, 1999.
9. S. Derisavi. Signature-based symbolic algorithm for optimal Markov chain lumping. In Proc. of QEST, pp. 141-150, Sept. 2007.
10. S. Derisavi. A symbolic algorithm for optimal Markov chain lumping. In Proc. of TACAS, LNCS, pp. 139-154, 2007.
11. J.-C. Fernandez, H. Garavel, A. Kerbrat, R. Mateescu, L. Mounier, and M. Sighireanu. CADP: A Protocol Validation and Verification Toolbox. In Proc. of CAV, vol. 1102 of LNCS, pp. 437-440, 1996.
12. K. Fisler and M. Y. Vardi. Bisimulation minimization and symbolic model checking. FMSD, 21(1):39-78, 2002.
13. J. F. Groote and A. Ponse. The syntax and semantics of μCRL. In Algebra of Communicating Processes '94, Workshops in Computing Series, pp. 26-62, 1995.
14. th Int'l AMAST Workshop on Real-Time and Probabilistic Systems (ARTS'99), vol. 1601 of LNCS, pp. 144-264, 1999.
15. A. Hinton, M. Kwiatkowska, G. Norman, and D. Parker. PRISM: A tool for automatic verification of probabilistic systems. In Proc. of TACAS, vol. 3920 of LNCS, pp. 441-444, 2006.
16. O. Ibe and K. Trivedi. Stochastic Petri net models of polling systems. IEEE Journal on Selected Areas in Communications, 8(9):1649-1657, 1990.
17. P. C. Kanellakis and S. A. Smolka. CCS expressions, finite state processes, and three problems of equivalence. Information and Computation, 86(1):43-68, 1990.
18. J.-P. Katoen, T. Kemna, I. Zapreev, and D. N. Jansen. Bisimulation minimization mostly speeds up probabilistic model checking. In Proc. of TACAS, vol. 4424 of LNCS, pp. 87-101, 2007.
19. M. Kwiatkowska, G. Norman, and D. Parker. Symmetry reduction for probabilistic model checking. In Proc. of CAV, vol. 4114 of LNCS, pp. 234-248, 2006.
20. th Annual ACM Symposium on Principles of Programming Languages (POPL), pp. 344-352, 1989.
21. th Colloquium on Trees in Algebra and Programming (CAAP), vol. 112 of LNCS, pp. 25-34, 1981.
22. R. Milner. Lectures on a calculus for communicating systems. In Seminar on Concurrency, vol. 197 of LNCS, pp. 197-220, 1985.
23. R. Paige and R. E. Tarjan. Three partition refinement algorithms. SIAM J. Comp., 16(6):973-989, 1987.
24. D. Parker. Implementation of Symbolic Model Checking for Probabilistic Systems. Phd thesis, University of Birmingham, Great Britain, 2002.
25. W. H. Sanders and L. M. Malhis. Dependability evaluation using composed SAN-based reward models. J. Parallel Distr. Comp., 15(3):238-254, July 1992.
26. F. Somenzi. CUDD: Colorado University decision diagram package. public software, Colorado University, Boulder, http://vlsi.colorado.edu/~fabio/, 2007.
27. R. Wimmer, M. Herbstritt, and B. Becker. Optimization techniques for BDD-based bisimulation minimization. In ACM Great Lakes Symposium on VLSI, pp. 405-410, 2007.
28. R. Wimmer, M. Herbstritt, H. Hermanns, K. Strampp, and B. Becker. Sigref - A symbolic bisimulation tool box. In Proc. of ATVA, vol. 4218 of LNCS, pp. 477-492, 2006.