Game-based abstraction for Markov decision processes

Third International Conference on the Quantitative Evaluation of Systems, QEST 2006

Volumn , Issue , 2006, Pages 157-166

  Kwiatkowska, Marta ^a   Norman, Gethin ^a   Parker, David ^a  

^a UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; MODEL CHECKING; NETWORK PROTOCOLS; PROBLEM SOLVING; SYSTEMS ANALYSIS;

ABSTRACTION METHODS; MARKOV DECISION PROCESSES; STATE-SPACE EXPLOSION PROBLEM; ZEROCONF DYNAMIC NETWORK CONFIGURATION PROTOCOL;

MARKOV PROCESSES;

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

References (33)

1. C. Baier and M. Kwiakowska. Model checking for a probabilistic branching time logic with fairness. Distributed Computing, 11(3):125-155, 1998.
2. D. Bertsekas and J. Tsitsiklis. An analysis of stochastic shortest path problems. Mathematics of Operations Research, 16(3):580-595, 1991.
3. C.Baier, M. Grosser, and F. Ciesinski. Partial order reduction for probabilistic systems. In Proc. QEST'04, pages 230-239. IEEE Computer Society Press, 2004.
4. K. Chatterjee, L. de Alfaro, and T. Henzinger. Trading memory for randomness. In Proc. QEST'04, pages 206-217. IEEE Computer Society Press, 2004.
5. S. Cheshire, B. Adoba, and E. Guttman. Dynamic configuration of IPv4 link-local addresses (draft August 2002). Zeroconf Working Group of the Internet Engineering Task Force (www.zeroconf.org).
6. E. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample- guided abstraction refinement. In A. Emerson and A. Sistla, editors, Proc. CAV'00, volume 1855 of LNCS, pages 154-169. Springer, 2000.
7. E. Clarke, O. Grumberg, and D. Peled. Model Checking. The MIT Press, 1999.
8. A. Condon. The complexity of stochastic games. Information and Computation, 96(2):203-224, 1992.
9. A. Condon. On algorithms for simple stochastic games. Advances in computational complexity theory, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 13:51-73, 1993.
10. P. D'Argenio, B. Jeannet, H. Jensen, and K. Larsen. Reachability analysis of probabilistic systems by successive refinements. In L. de Alfaro and S. Gilmore, editors, Proc. PAPM/PROBMIV'Ol, volume 2165 of LNCS, pages 39-56. Springer, 2001.
11. P. D'Argenio and P. Niebert. Partial order reduction on concurrent probabilistic programs. In Proc. QEST'04, pages 240-249. IEEE Computer Society Press, 2004.
12. L. de Alfaro. Formal Verification of Probabilistic Systems. PhD thesis, Stanford University, 1997.
13. L. de Alfaro. Computing minimum and maximum reachability times in probabilistic systems. In J. Baeten and S. Mauw, editors, Proc. CONCUR'99, volume 1664 of LNCS, pages 66-81. Springer, 1999.
14. L. de Alfaro, T. Henzinger, and O. Kupferman. Concurrent reachability games. In Proc. FOCS'98, pages 564-575. IEEE Computer Society Press, 1998.
15. J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. Approximating labelled Markov processes. Information and Computation, 184(1): 160-200, 2003.
16. H. Fecher, M. Leucker, and V. Wolf. Don't know in probabilistic systems. In A. Valmari, editor, Proc. SPIN'06, volume 3925 of LNCS, pages 71-88. Springer, 2006.
17. H. Hansson and B. Jonsson. A logic for reasoning about time and reliability. Formal Aspects of Computing, 6(5):512-535, 1994.
18. A. Hinton, M. Kwiatkowska, G. Norman, and D. Parker. PRISM: A tool for automatic verification of probabilistic systems. In H. Hermanns and J. Palsberg, editors, Proc. TACAS'06, volume 3920 of LNCS, pages 441-444. Springer, 2006.
19. J. Hurd, A. McIver, and C. Morgan. Probabilistic guarded commands mechanized in HOL. Theoretical Computer Science, 346(1):96-112, 2005.
20. H. Huth. An abstraction framework for mixed nondeterministic and probabilistic systems. In C. Baier, B. Haverkort, H. Hermanns, J.-P. Katoen, and M. Siegle, editors, Validation of Stochastic Systems: A Guide to Current Research, volume 2925 of LNCS, pages 419-444. Springer, 2004.
21. M. Huth. On finite-state approximants for probabilistic computation tree logic. Theoretical Computer Science, 346(1):113-134, 2005.
22. J. Kemeny, J. Snell, and A. Knapp. Denumerable Markov Chains. D. Van Nostrand Company, 1966.
23. M. Kwiatkowska, G. Norman, and D. Parker. Probabilistic symbolic model checking with PRISM: A hybrid approach. International Journal on Software Tools for Technology Transfer, 6(2): 128-142, 2004.
24. M. Kwiatkowska, G. Norman, and D. Parker. Game-based abstraction for Markov decision processes. Technical Report CSR-06-05, School of Computer Science, University of Birmingham, 2006.
25. M. Kwiatkowska, G. Norman, D. Parker, and J. Sproston. Performance analysis of probabilistic timed automata using digital clocks. In K. Larsen and P. Niebert, editors, Proc. FORMATS'03, volume 2791 of LNCS, pages 105-120. Springer, 2003.
26. A. McIver and C. Morgan. Abstraction, Refinement and Proof for Probabilistic Systems. Monographs in Computer Science. Springer, 2004.
27. D. Monniaux. Abstract interpretation of programs as Markov decision processes. Science of Computer Programming, 58(1-2): 179- 205, 2005.
28. G. Norman. Analyzing randomized distributed algorithms. In C. Baier, B. Haverkort, H. Hermanns, J.-P. Katoen, and M. Siegle, editors, Validation of Stochastic Systems: A Guide to Current Research, volume 2925 of LNCS, pages 384-418. Springer, 2004.
29. PRISM web site. www.cs.bham.ac.uk/~dxp/prism.
30. R. Segala. Modelling and Verification of Randomized Distributed Real Time Systems. PhD thesis, Massachusetts Institute of Technology, 1995.
31. K. Sen, M. Viswanathan, and G. Agha. Model-checking Markov chains in the presence of uncertainties. In H. Hermanns and J. Palsberg, editors, Proc. TACAS'06, volume 3920 of LNCS, pages 394-410. Springer, 2006.
32. S. Shoham and O. Grumberg. A game-based framework for CTL counter-examples and 3-valued abstraction-refinement. In W. Hunt and E Somenzi, editors, Proc. CAV'03, volume 2725 of LNCS, pages 275-287. Springer, 2003.
33. L. Zuck, A. Pnueli, and Y. Kesten. Automatic verification of probabilistic free choice. In A. Cortesi, editor, Proc. VM-CAI'02, volume 2294 of LNCS, pages 208-224. Springer, 2002.