Reachability in recursive Markov decision processes

Information and Computation

Volumn 206, Issue 5, 2008, Pages 520-537

  Brázdil, Tomáš ^a   Brožek, Václav ^a   Forejt, Vojtěch ^a   Kučera, Antonín ^a  

^a MASARYK UNIVERSITY   (Czech Republic)

Author keywords

Markov decision processes; Stochastic games; Temporal logics

Indexed keywords

FINITE AUTOMATA; GAME THEORY; MARKOV PROCESSES; POLYNOMIAL APPROXIMATION; PROBABILITY;

MARKOV DECISION PROCESSES; STOCHASTIC GAMES; TEMPORAL LOGICS;

DECISION THEORY;

EID: 41349101720     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2007.09.002     Document Type: Article

References (14)

1. Baier C., and Kwiatkowska M. Model checking for a probabilistic branching time logic with fairness. Distributed Computing 11 3 (1998) 125-155
2. Bianco A., and de Alfaro L. Model checking of probabalistic and nondeterministic systems. Proceedings of FST&TCS'95. Lecture Notes in Computer Science vol. 1026 (1995), Springer 499-513
3. Bouajjani A., Esparza J., and Maler O. Reachability analysis of pushdown automata: application to model checking. Proceedings of CONCUR'97. Lecture Notes in Computer Science vol. 1243 (1997), Springer 135-150
4. Brázdil T., Kučera A., and Stražovský O. On the decidability of temporal properties of probabilistic pushdown automata. Proceedings of STACS'2005. Lecture Notes in Computer Science vol. 3404 (2005), Springer 145-157
5. Esparza J., Kučera A., and Mayr R. Model-checking probabilistic pushdown automata. Proceedings of LICS 2004 (2004), IEEE Computer Society Press 12-21
6. Esparza J., Kučera A., and Schwoon S. Model-checking LTL with regular valuations for pushdown systems. Information and Computation 1862 (2003) 355-376
7. Etessami K., and Yannakakis M. Recursive Markov decision processes and recursive stochastic games. Proceedings of ICALP 2005. Lecture Notes in Computer Science vol. 3580 (2005), Springer 891-903
8. Etessami K., and Yannakakis M. Efficient qualitative analysis of classes of recursive Markov decision processes and simple stochastic games. Proceedings of STACS'2006. Lecture Notes in Computer Science vol. 3884 (2006), Springer 634-645
9. In: Feinberg E., and Shwartz A. (Eds). Handbook of Markov Decision Processes (2002), Kluwer
10. Feller W. An Introduction to Probability Theory and its Applications vol. 1 (1968), Wiley
11. Hansson H., and Jonsson B. A logic for reasoning about time and reliability. Formal Aspects of Computing 6 (1994) 512-535
12. A. Hinton, M. Kwiatkowska, G. Norman, D. Parker, PRISM a tool for automatic verification of probabilistic systems, in: Proceedings of TACAS 2006, Lecture Notes in Computer Science, vol. 3920, Springer, 2006, pp. 441-444.
13. Puterman M.L. Markov Decision Processes (1994), Wiley
14. Walukiewicz I. Pushdown processes: games and model-checking. Information and Computation 1642 (2001) 234-263