Symbolic partition refinement with automatic balancing of time and space

Performance Evaluation

Volumn 67, Issue 9, 2010, Pages 816-836

  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

Markov chains; State space lumping; Symbolic methods

Indexed keywords

AUTOMATIC BALANCING; EXACT RESULTS; EXPLICIT REPRESENTATION; INTERACTIVE MARKOV CHAINS; LABELED TRANSITION SYSTEMS; LUMPED MODELS; MARKOV CHAIN; MARKOV MODEL; MARKOV REWARD MODEL; MEMORY CONSUMPTION; NUMERICAL ALGORITHMS; ORIGINAL SYSTEMS; PARTITION REFINEMENT; PERFORMANCE EVALUATION; RUNTIMES; STATE SPACE; STATE-BASED; STATE-SPACE EXPLOSION; SYMBOLIC METHODS; TIME AND SPACE;

ALGORITHMS; NUMERICAL ANALYSIS;

MARKOV PROCESSES;

EID: 77955309043     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.peva.2009.12.008     Document Type: Article

References (52)

1. D. Park Concurrency and automata on infinite sequences P. Deussen, Proc. of the 5th GI-Conference on Theoretical Computer Science Lecture Notes in Computer Science vol. 104 1981 Springer 167 183
2. J.G. Kemeney, and J.L. Snell Finite Markov Chains 1960 D. Van Nostrand Company, Inc.
3. W.H. Sanders, and J.F. Meyer Reduced base model construction methods for stochastic activity networks IEEE Journal on Selected Areas in Communication 9 1 1991 25 36
4. H. Hermanns, M. Ribaudo, Exploiting symmetries in stochastic process algebras, in: 12th European Simulation Multiconference, 1998, pp. 763770
5. S. Gilmore, J. Hillston, and M. Ribaudo An efficient algorithm for aggregating PEPA models IEEE Transactions on Software Engineering 27 5 2001 449 464 (Pubitemid 32534358)
6. G. Chiola, C. Dutheillet, G. Franceschinis, and S. Haddad Stochastic well-formed colored nets and symmetric modeling applications IEEE Transactions on Computers 42 11 1993 1343 1360
7. S. Derisavi, P. Kemper, and W.H. Sanders Symbolic state-space exploration and numerical analysis of state-sharing composed models Linear Algebra and Its Applications 386 2004 137 166
8. M. Kwiatkowska, G. Norman, and D. Parker Symmetry reduction for probabilistic model checking Proc. of the Int'l Conf. on Computer-Aided Verification CAV Lecture Notes in Computer Science vol. 4114 2006 234 248 (Pubitemid 44560880)
9. K.G. Larsen, A. Skou, Bisimulation through probabilistic testing, in: 16th Annual ACM Symposium on Principles of Programming Languages, POPL, 1989, pp. 344352
10. J. Hillston A Compositional Approach to Performance Modelling 1996 Cambridge University Press
11. J. Hillston, H. Hermanns, U. Herzog, V. Mertsiotakis, and M. Rettelbach Stochastic process algebras: Integrating qualitative and quantitative modelling 7th IFIP WG6.1 International Conference on Formal Description Techniques, FORTE IFIP Conference Proceedings vol. 6 1994 Chapman & Hall 449 451
12. P. Buchholz Exact and ordinary lumpability in finite Markov chains Journal of Applied Probability 31 1994 59 74
13. S. Derisavi, H. Hermanns, and W.H. Sanders Optimal state-space lumping in Markov chains Information Processing Letters 87 6 2003 309 315
14. J.-P. Katoen, T. Kemna, I. Zapreev, and D.N. Jansen Bisimulation minimization mostly speeds up probabilistic model checking Proc. of the Int'l Conf. on Tools and Algorithms for the Construction and Analysis of Systems, TACAS Lecture Notes in Computer Science vol. 4424 2007 87 101
15. E. Clarke, M. Fujita, P. McGeer, K. McMillan, J. Yang, and X. Zhao Multiterminal binary decision diagrams: An efficient data structure for matrix representation Formal Methods in System Design 10 23 1997 149 169
16. I. Bahar, E. Frohm, C. Gaona, G. Hachtel, E. Macii, A. Pardo, and F. Somenzi Algebraic decision diagrams and their applications Formal Methods in System Design 10 23 1997 171 206
17. Y.-T. Lai, and S. Sastry Edge-valued binary decision diagrams for multi-level hierarchical verification Proc. of the 1992 Design Automation Conference, DAC 1992 IEEE CS Press 608 613
18. Y.-T. Lai, M. Pedram, and S.B.K. Vrudhula Formal verification using edge-valued binary decision diagrams IEEE Transaction on Computers 45 2 1996 247 255
19. S. Minato Zero-suppressed BDDs for set manipulation in combinatorial problems Proc. of the 1993 Design Automation Conference, DAC 1993 272 277
20. G. Ciardo, A.S. Miner, A data structure for the efficient Kronecker solution of GSPNs, in: 8th International Workshop on Petri Nets Performance Models, PNPM, 1999, pp. 2231
21. A. Hinton, M. Kwiatkowska, G. Norman, and D. Parker PRISM: A tool for automatic verification of probabilistic systems Proc. of the Int'l Conf. on Tools and Algorithms for the Construction and Analysis of Systems TACAS Lecture Notes in Computer Science vol. 3920 2006 441 444
22. M. Kuntz, M. Siegle, and E. Werner Symbolic performance and dependability evaluation with the tool CASPA FORTE Workshops 2004 Lecture Notes in Computer Science vol. 3236 2004 Springer 293 307
23. E. Bde, M. Herbstritt, H. Hermanns, S. Johr, T. Peikenkamp, R. Pulungan, J. Rakow, R. Wimmer, and B. Becker Compositional dependability evaluation for statemate IEEE Transactions on Software Engineering 35 3 2009 274 292
24. R. Enders, T. Filkorn, and D. Taubner Generating BDDs for symbolic model checking in CCS Distributed Computing 6 3 1993 155 164
25. H. Hermanns, J. Meyer-Kayser, and M. Siegle Multi terminal binary decision diagrams to represent and analyse continuous time Markov Chains B. Plateau, W.J. Stewart, M. Silva, 3rd Int'l Workshop on the Numerical Solution of Markov Chains NSMC 1999 Prensas Universitarias de Zaragoza Zaragoza, Spain 188 207
26. H. Hermanns, M.Z. Kwiatkowska, G. Norman, D. Parker, and M. Siegle On the use of MTBDDs for performability analysis and verification of stochastic systems Journal of Logic and Algebraic Programming 56 12 2003 23 67
27. M. Kwiatkowska, G. Norman, and D. Parker Probabilistic symbolic model checking with PRISM: A hybrid approach Software Tools for Technology Transfer 6 2 2004 128 142
28. S. Blom, and S. Orzan Distributed branching bisimulation reduction of state spaces Proc. of the Int'l Workshop on Parallel and Distributed Model Checking Electronic Notes in Theoretical Computer Science vol. 89 2003 Elsevier 99 113
29. S. Blom, and S. Orzan A distributed algorithm for strong bisimulation reduction of state spaces Software Tools for Technology Transfer 7 1 2005 74 86
30. S. Blom, and S. Orzan Distributed state space minimization Software Tools for Technology Transfer 7 3 2005 280 291
31. R. Wimmer, M. Herbstritt, H. Hermanns, K. Strampp, and B. Becker Sigref A symbolic bisimulation tool box Proc. of the Int'l Symp. on Automated Technology for Verification and Analysis ATVA Lecture Notes in Computer Science vol. 4218 2006 477 492
32. S. Derisavi A symbolic algorithm for optimal Markov chain lumping Proc. of the Int'l Conf. on Tools and Algorithms for the Construction and Analysis of Systems TACAS Lecture Notes in Computer Science 2007 139 154
33. S. Derisavi, Signature-based symbolic algorithm for optimal Markov chain lumping, in: Proc. of the Int'l Conf. on Quantitative Evaluation of Systems, QEST, 2007, pp. 141150
34. E. Bode, M. Herbstritt, H. Hermanns, S. Johr, T. Peikenkamp, R. Pulungan, R. Wimmer, B. Becker, Compositional performability evaluation for statemate, in: Proc. of the Int'l Conf. on Quantitative Evaluation of Systems, QEST, 2006, pp. 167178
35. P.J. Schweitzer Aggregation methods for large Markov chains G. Iazeolla, P.-J. Courtois, A. Hordijk, Proc. of the Int'l Workshop on Computer Performance and Reliability 1984 Elsevier 275 286
36. S. Baarir, C. Dutheillet, S. Haddad, and J.-M. Ili On the use of exact lumpability in partially symmetrical well-formed nets Proc. of the Int'l Conf. on Quantitative Evaluation of Systems QEST 2005 IEEE CS Press 23 32
37. M. Bozga, and O. Maler On the representation of probabilities over structured domains N. Halbwachs, D. Peled, Proc. of the Int'l Conf. on Computer-Aided Verification CAV Lecture Notes in Computer Science vol. 1633 1999 Springer Trento, Italy 261 273
38. K. Lampka, and M. Siegle Analysis of Markov reward models using zero-suppressed multi-terminal BDDs L. Lenzini, R.L. Cruz, Proc. of the 1st Int'l Conf. Performance Evaluation Methodologies and Tools (VALUETOOLS) ACM International Conference Proceeding Series vol. 180 2006 ACM 35
39. I. Wegener SIAM Monographs on Discrete Mathematics and Applications 2000 SIAM
40. H. Hermanns, M.Z. Kwiatkowska, G. Norman, D. Parker, and M. Siegle On the use of MTBDDs for performability analysis and verification of stochastic systems Journal of Logic and Algebraic Programming 56 12 2003 23 67
41. J.E. Hopcroft An n log n algorithm for minimizing states in a finite automaton Z. Kohavi, A. Paz, Theory of Machines and Computations 1971 Academic Press 189 196
42. S. Derisavi, Solution of large Markov models using lumping techniques and symbolic data structures, University of Illinois at Urbana-Champaign, 2005
43. A. Bouali, and R. de Simone Symbolic bisimulation minimisation Proc. of the Int'l Conf. on Computer-Aided Verification CAV Lecture Notes in Computer Science vol. 663 1992 96 108
44. R. Wimmer, M. Herbstritt, and B. Becker Optimization techniques for BDD-based bisimulation minimization ACM Great Lakes Symposium on VLSI 2007 405 410
45. F. Somenzi, CUDD: Colorado University decision diagram package. public software, Colorado University, Boulder, 2007. http://vlsi.colorado.edu/fabio/
46. W.H. Sanders, and L.M. Malhis Dependability evaluation using composed SAN-based reward models Journal Parallel and Distributed Computing 15 3 1992 238 254
47. O. Ibe, and K. Trivedi Stochastic Petri net models of polling systems IEEE Journal on Selected Areas in Communications 8 9 1990 1649 1657
48. H. Younes, M. Kwiatkowska, G. Norman, and D. Parker Numerical vs. statistical probabilistic model checking Software Tools for Technology Transfer 8 3 2006 216 228 (Pubitemid 44445181)
49. G. Ciardo, M. Tilgner, On the use of Kronecker operators for the solution of generalized stochastic Petri nets, ICASE Report, Institute for Computer Applications in Science and Engineering, 1996
50. J. Heath, M. Kwiatkowska, G. Norman, D. Parker, and O. Tymchyshyn Probabilistic model checking of complex biological pathways Theoretical Computer Science 319 3 2008 239 257
51. P. Lecca, and C. Priami Cell cycle control in eukaryotes: A BioSpi model Electronic Notes in Theoretical Computer Science 180 3 2007 51 63
52. H. Hermanns, and M. Siegle Bisimulation algorithms for stochastic process algebras and their BDD-based implementation Proc. of the 5th Int'l AMAST Workshop on Real-Time and Probabilistic Systems, ARTS'99 Lecture Notes in Computer Science vol. 1601 1999 144 264