Bisimulation minimisation mostly speeds up probabilistic model checking

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4424 LNCS, Issue , 2007, Pages 87-101

  Katoen, Joost Pieter ^a,b   Kemna, Tim ^b   Zapreev, Ivan ^a,b   Jansen, David N ^a,b  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; DISCRETE TIME CONTROL SYSTEMS; MARKOV PROCESSES; VERIFICATION;

LOGARITHMIC SAVINGS; MONOLITHIC DISCRETE-TIME; PROBABILISTIC BISIMULATION;

PROBABILISTIC LOGICS;

EID: 37149024894     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71209-1_9     Document Type: Conference Paper

References (39)

1. Andova, S., Hermanns, H., Katoen, J.-P.: Discrete-time rewards model-checked. In Larsen, K. G., et al. (eds.): FORMATS. LNCS, Vol. 2791. Springer, Berlin (2003) 88-104
2. Aziz, A., Sanwal, K., Singhal, V., Brayton, R.: Model-checking continuous time Markov chains. ACM TOCL 1 (2000) 162-170
3. Aziz, A., Singhal, V., Balarin, F., Brayton, R. K., Sangiovanni- Vincentelli, A. L.: It usually works: the temporal logic of stochastic systems. In Wolper, P. (ed.): CAV. LNCS, Vol. 939. Springer, Berlin (1995) 155-165
4. Baier, C., Ciesinski, F., Größer, M.: ProbMela and verification of Markov decision processes. Performance Evaluation Review 32 (2005) 22-27
5. Baier, C., Haverkort, B., Hermanns, H., Katoen, J.-P.: On the logical characterisation of performability properties. In Montanari, U., et al. (eds.): ICALP. LNCS, Vol. 1853. Springer, Berlin (2000) 780-792
6. Baier, C., Haverkort, B., Hermanns, H., Katoen, J.-P.: Model-checking algorithms for continuous-time Markov chains. IEEE TSE 29 (2003) 524-541
7. Baier, C., Katoen, J.-P., Hermanns, H., Wolf, V.: Comparative branching-time semantics for Markov chains. Information and Computation 200 (2005) 149-214
8. Ben Mamoun, M., Pekergin, N., Younès, S.: Model checking of continuous-time Markov chains by closed-form bounding distributions. In: QEST. IEEE CS, Los Alamitos (2006) 189-198
9. Böde, E., Herbstritt, M., Hermanns, H., Johr, S., Peikenkamp, T., Pulungan, R., Wimmer, R., Becker, B.: Compositional performability evaluation for STATEMATE. In: QEST. IEEE CS, Los Alamitos (2006) 167-178
10. Buchholz, P.: Exact and ordinary lumpability in finite Markov chains. Journal of Applied Probability 31 (1994) 59-75
11. D'Aprile, D., Donatelli, S., Sproston, J.: CSL model checking for the GreatSPN tool. In Aykanat, C., et al. (eds.): Computer and Information Sciences, ISCIS. LNCS, Vol. 3280. Springer, Berlin (2004) 543-553
12. D'Argenio, P. R., Jeannet, B., Jensen, H. E., Larsen, K. G.: Reachability analysis of probabilistic systems by successive refinements. In de Alfaro, L., et al. (eds.): PAPM-PROBMIV. LNCS, Vol. 2165. Springer, Berlin (2001) 39-56
13. Derisavi, S.: Solution of Large Markov Models using Lumping Techniques and Symbolic Data Structures. PhD thesis, Univ. of Illinois at Urbana-Champaign (2005)
14. Derisavi, S., Hermanns, H., Sanders, W. H.: Optimal state-space lumping in Markov chains. IPL 87 (2003) 309-315
15. Fecher, H., Leucker, M., Wolf, V.: Don't know in probabilistic systems. In Valmari, A. (ed.): Model Checking Software. LNCS, Vol. 3925. Springer, Berlin (2006) 71-88
16. Fisler, K., Vardi, M. Y.: Bisimulation minimization in an automata-theoretic verification framework. In Gopalakrishnan, G., et al. (eds.): FMCAD. LNCS, Vol. 1522. Springer, Berlin (1998) 115-132
17. Fisler, K., Vardi, M. Y.: Bisimulation and model checking. In Pierre, L., et al. (eds.): CHARME. LNCS, Vol. 1703. Springer, Berlin (1999) 338-342
18. Fisler, K., Vardi, M. Y.: Bisimulation minimization and symbolic model checking. Formal Methods in System Design 21 (2002) 39-78
19. Groesser, M., Baier, C.: Partial order reduction for Markov decision processes: a survey. In de Boer, F. S., et al. (eds.): FMCO. LNCS, Vol. 4111. Springer, Berlin (2006) 408-427
20. Hansson, H., Jonsson, B.: A logic for reasoning about time and reliability. Formal Aspects of Computing 6 (1994) 512-535
21. Haverkort, B., Cloth, L., Hermanns, H., Katoen, J.-P., Baier, C.: Model checking performability properties. In: DSN. IEEE CS, Los Alamitos (2002) 103-112
22. Haverkort, B. R., Hermanns, H., Katoen, J.-P.: On the use of model checking techniques for quantitative dependability evaluation. In: 19th IEEE Symposium on Reliable Distributed Systems. IEEE CS, Los Alamitos (2000) 228-237
23. Hermanns, H., Kwiatkowska, M., Norman, G., Parker, D., Siegle, M.: On the use of MTBDDs for performability analysis and verification of stochastic systems. J. of Logic and Alg. Progr. 56 (2003) 23-67
24. Hillston, J.: A Compositional Approach to Performance Modelling. Cambridge University Press (1996)
25. Huth, M.: An abstraction framework for mixed non-deterministic and probabilistic systems. In Baier, C., et al. (eds.): Validation of Stochastic Systems. LNCS, Vol. 2925. Springer, Berlin (2004) 419-444
26. Huth, M.: On finite-state approximants for probabilistic computation tree logic. TCS 346 (2005) 113-134
27. Ibe, O. C., Trivedi, K. S.: Stochastic Petri net models of polling systems. IEEE J. on Selected Areas in Communications 8 (1990) 1649-1657
28. Itai, A., Rodeh, M.: Symmetry breaking in distributed networks. Information and Computation 88 (1990) 60-87
29. Katoen, J.-P., Khattri, M., Zapreev, I. S.: A Markov reward model checker. In: QEST. IEEE CS, Los Alamitos (2005) 243-244
30. Katoen, J.-P., Zapreev, I. S.: Safe on-the-fly steady-state detection for timebounded reachability. In: QEST. IEEE CS, Los Alamitos (2006) 301-310
31. Kwiatkowska, M., Norman, G., Parker, D.: Probabilistic symbolic model checking with PRISM: a hybrid approach. Int. J. on STTT 6 (2004) 128-142
32. Kwiatkowska, M., Norman, G., Parker, D.: Game-based abstraction for Markov decision processes. In: QEST. IEEE CS, Los Alamitos (2006) 157-166
33. Kwiatkowska, M., Norman, G., Parker, D.: Symmetry reduction for probabilistic model checking. In Ball, T., et al. (eds.): CAV. LNCS, Vol. 4144. Springer, Berlin (2006) 234-248
34. Larsen, K. G., Skou, A.: Bisimulation through probabilistic testing. Information and Computation 94 (1991) 1-28
35. Massink, M., Katoen, J.-P., Latella, D.: Model checking dependability attributes of wireless group communication. In: DSN. IEEE CS, Los Alamitos (2004) 711-720
36. Monniaux, D.: Abstract interpretation of programs as Markov decision processes. Science of Computer Programming 58 (2005) 179-205
37. Pnueli, A., Zuck, L.: Verification of multiprocess probabilistic protocols. Distributed Computing 1 (1986) 53-72
38. Reiter, M. K., Rubin, A. D.: Crowds: anonymity for web transactions. ACM Transactions on Information and System Security 1 (1998) 66-92
39. Sproston, J., Donatelli, S.: Backward bisimulation in Markov chain model checking. IEEE TSE 32 (2006) 531-546