Incremental quantitative verification for Markov decision processes

Proceedings of the International Conference on Dependable Systems and Networks

Volumn , Issue , 2011, Pages 359-370

  Kwiatkowska, Marta ^a   Parker, David ^a   Qu, Hongyang ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

incremental verification; Markov decision processes; performance analysis; probabilistic model checking; Quantitative verification

Indexed keywords

INCREMENTAL VERIFICATION; MARKOV DECISION PROCESSES; PERFORMANCE ANALYSIS; PROBABILISTIC MODEL CHECKING; QUANTITATIVE VERIFICATION;

DATA STRUCTURES; MODEL CHECKING;

MARKOV PROCESSES;

EID: 80051922471     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DSN.2011.5958249     Document Type: Conference Paper

References (27)

1. H. Hansson and B. Jonsson, "A logic for reasoning about time and reliability," Formal Aspects of Computing, vol. 6, no. 5, pp. 512-535, 1994.
2. A. Bianco and L. de Alfaro, "Model checking of probabilistic and nondeterministic systems," in Proc. FSTTCS'95, ser. LNCS, vol. 1026. Springer, 1995.
3. M. Kwiatkowska, G. Norman, and D. Parker, "PRISM 4.0: Verification of probabilistic real-time systems," in Proc. CAV'11, ser. LNCS. Springer, 2011.
4. R. Calinescu and M. Kwiatkowska, "Using quantitative analysis to implement autonomic IT systems," in Proc. ICSE'09, 2009, pp. 100-110.
5. A. Filieri, C. Ghezzi, and G. Tamburrelli, "Run-time efficient probabilistic model checking," in Proc. ICSE'11. ACM, 2011.
6. F. Ciesinski, C. Baier, M. Größer, and J. Klein, "Reduction techniques for model checking Markov decision processes," in Proc. QEST'08. IEEE CS Press, 2008, pp. 45-54.
7. R. Tarjan, "Depth-first search and linear graph algorithms," SIAM Journal on Computing, vol. 1, pp. 146-160, 1972.
8. R. Bloem, H. N. Gabow, and F. Somenzi, "An algorithm for strongly connected component analysis in log symbolic steps," in Proc. FMCAD'00, ser. LNCS, vol. 1954. Springer, 2000, pp. 37-54.
9. R. Gentilini, C. Piazza, and A. Policriti, "Computing strongly connected components in a linear number of symbolic steps," in Proc. SODA'03, 2003, pp. 573-582.
10. E. Á brahám, N. Jansen, R.Wimmer, J. Katoen, and B. Becker, "DTMC model checking by SCC reduction," in Proc. QEST'10. IEEE CS Press, 2010, pp. 37-46.
11. O. V. Sokolsky and S. A. Smolka, "Incremental model checking in the modal mu-calculus," in CAV 94, ser. LNCS, vol. 818. Springer, 1994, pp. 351-363.
12. C. L. Conway, K. S. Namjoshi, D. Dams, and S. A. Edwards, "Incremental algorithms for inter-procedural analysis of safety properties," in Proc. CAV'05, ser. LNCS, vol. 3576. Springer, 2005, pp. 449-461. (Pubitemid 41431756)
13. K. Heljanko, T. Junttila, and T. Latvala, "Incremental and complete bounded model checking for full PLTL," in CAV 05, ser. LNCS, vol. 3576. Springer, 2005, pp. 98-111. (Pubitemid 41431723)
14. J. Kemeny, J. Snell, and A. Knapp, Denumerable Markov Chains, 2nd ed. Springer-Verlag, 1976.
15. A. Pnueli, "The temporal logic of programs," in Proc. FOCS'77. IEEE Computer Society Press, 1977, pp. 46-57.
16. C. Courcoubetis and M. Yannakakis, "The complexity of probabilistic verification," J. of the ACM, vol. 42, no. 4, 1995.
17. L. de Alfaro, "Formal verification of probabilistic systems," Ph.D. dissertation, Stanford University, 1997.
18. M. Puterman, Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley and Sons, 1994.
19. E. Nuutila and E. Soisalon-soininen, "On finding the strongly connected components in a directed graph," Information Processing Letters, vol. 49, pp. 9-14, 1994. (Pubitemid 124012523)
20. M. Kwiatkowska, G. Norman, D. Parker, and J. Sproston, "Performance analysis of probabilistic timed automata using digital clocks," FMSD, vol. 29, 2006.
21. M. Kwiatkowska, G. Norman, and R. Segala, "Automated verification of a randomized distributed consensus protocol using Cadence SMV and PRISM," in Proc. CAV'01, ser. LNCS, vol. 2102. Springer, 2001.
22. J. Aspnes and M. Herlihy, "Fast randomized consensus using shared memory," Journal of Algorithms, vol. 15, no. 1, 1990.
23. M. Kwiatkowska, G. Norman, and J. Sproston, "Probabilistic model checking of the IEEE 802.11 wireless local area network protocol," in Proc. PAPM/PROBMIV'02, ser. LNCS, vol. 2399. Springer, 2002, pp. 169-187.
24. http://www.prismmodelchecker.org/casestudies/.
25. R. Bryant, "Graph-based algorithms for Boolean function manipulation," IEEE Transactions on Computers, vol. C-35, no. 8, pp. 677-691, 1986. (Pubitemid 16629996)
26. J. Burch, E. Clarke, K. McMillan, D. Dill, and J. Hwang, "Symbolic model checking: 1020 states and beyond," in Proc. LICS'90. IEEE Computer Society Press, 1990, pp. 428-439.
27. M. Kwiatkowska, G. Norman, and J. Sproston, "Probabilistic model checking of deadline properties in the IEEE 1394 FireWire root contention protocol," Formal Aspects of Computing, vol. 14, no. 3, pp. 295-318, 2003.