Symbolic magnifying lens abstraction in Markov decision processes

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

Volumn , Issue , 2008, Pages 103-112

  Roy, Pritam ^a   Parker, David ^b   Norman, Gethin ^b   De Alfaro, Luca ^a  

^a University of California Santa Cruz   (United States)

^b UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; BINARY DECISION DIAGRAMS; COMBINES; CONCRETES; CONTROL THEORY; DATA STRUCTURES; FILE ORGANIZATION; LENSES; OPTICAL INSTRUMENTS; PATIENT MONITORING; PROBABILITY;

BINARY DECISIONS; CONCRETE STATES; ENCODINGS; MAGNIFYING LENSES; MARKOV DECISION PROCESSES; PRACTICAL TECHNIQUES; PROBABILISTIC MODELS; REACH ABILITIES; REFINEMENT TECHNIQUES; SAFETY PROPERTIES; SPACE EXPLOSIONS; SYMBOLIC TECHNIQUES; UPPER AND LOWER BOUNDS;

MODEL CHECKING;

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

References (26)

1. R.I. Bahar, E.A. Frohm, C.M. Gaona, G.D. Hachtel, E. Macii, A. Pardo, and F. Somenzi. Algebraic decision diagrams and their applications. Journal of Formal Methods in System Design, 10(2/3):171-206, 1997.
2. J.B. Berger and J. Oliger. Adaptive mesh refinement for hyperbolic partial differential equations. Journal of Computational Physics, 53:484-512, 1984.
3. D.P. Bertsekas. Dynamic Programming and Optimal Contrtrol. Athena Scientific, 1995. Volumes I and II.
4. R.E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35(8):677-691, 1986.
5. S. Cheshire, B. Adoba, and E. Gutterman. Dynamic configuration of IPv4 link local addresses. Available from http://www.ietf.org/rfc/rfc3927.txt.
6. E. Clarke, M. Fujita, P. McGeer, K. McMillan, J. Yang, and X. Zhao. Multi-terminal binary decision diagrams: An efficient data structure for matrix representation. Formal Methods in System Design, 10((2/3):149-169, 1997.
7. P. D' Argenio, B. Jeannet, H. Jensen, and K. Larsen. Reachability analysis of probabilistic systems by successive refinements. In Proc. PAPM/PROBMIV'01, volume 2165 of LNCS, pages 39-56. Springer, 2001.
8. L. de Alfaro. Formal Verification of Probabilistic Systems. PhD thesis, Stanford University, 1997. Technical Report STAN-CS-TR-98-1601.
9. L. de Alfaro, M. Kwiatkowska, G. Norman, D. Parker, and R. Segala. Symbolic model checking of concurrent probabilistic processes using MTBDDs and the Kronecker representation. In Proc. TACAS'00, volume 1785 of LNCS, pages 395-410. Springer, 2000.
10. L. de Alfaro and R. Majumdar. Quantitative solution of omega-regular games. Journal of Computer and System Sciences, 68:374-397, 2004.
11. Luca de Alfaro and Pritam Roy. Magnifying-lens abstraction for Markov decision processes. In Proc. CAV'07, volume 4590 of LNCS, pages 325-338. Springer, 2007.
12. S. Derisavi. A symbolic algorithm for optimal Markov chain lumping. In O. Grumberg and M. Huth, editors, Proc. TACAS'07 volume 4424 of LNCS, pages 139-154. Springer, 2007.
13. C. Derman. Finite State Markovian Decision Processes. Academic Press, 1970.
14. M. Duflot, M. Kwiatkowska, G. Norman, and D. Parker. A formal analysis of Bluetooth device discovery. Int. Journal on Software Tools for Technolo Transfer, 8(6):621-632, 2006.
15. H. Hermanns, M. 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(1-2):23-67, 2003.
16. A. Hinton, M. Kwiatkowska, G. Norman, and D. Parker. PRISM: A tool for automatic verification of probabilistic systems. In Proc. TACAS'06, volume 3920 of LNCS, pages 441-444. Springer, 2006.
17. M. Huth. On finite-state approximations for probabilistic computational-tree logic. Theor. Comp. Sci., 346(1):113-134, 2005.
18. J.G. Kemeny, J.L. Snell, and A. W. Knapp. Denumerable Markov Chains. D. Van Nostrand Company, 1966.
19. M. Kwiatkowska, G. Norman, and D. Parker. Gamebased abstraction for markov decision processes. In Proc. QEST'06, pages 157-166. IEEE CS, 2006.
20. M. Kwiatkowska, G. Norman, and D. Parker. Symmetry reduction for probabilistic model checking. In T. Ball and R. Jones, editors, Proc. CAV'06, volume 4114 of LNCS, pages 234-248. Springer, 2006.
21. M. Kwiatkowska, G. Norman, and R. Segala. Automated verification of a randomized distributed consensus protocol using Cadence SMV and PRISM. In G. Berry, H. Comon, and A. Finkel, editors, Proc. CAV'01, volume 2102 of LNCS, pages 194-206. Springer, 2001.
22. D. Monniaux. Abstract interpretation of programs as Markov decision processes. Science of Computer Programming 58(1-2):179-205, 2005.
23. D. Parker. Implementation of Symbolic Model Checking for Probabilistic Systems. PhD thesis, University of Birmingham, 2002.
24. PRISM web site. www.prismmodelchecker.org.
25. J. Rutten, M. Kwiatkowska, G. Norman, and D. Parker. Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems, P. Panangaden and F. van Breugel (eds.), volume 23 of CRM Monograph Series. American Mathematical Society, 2004.
26. R. Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT, 1995. Techncal Report MIT/LCS/TR-676.