On the controller synthesis for finite-state markov decision processes

Fundamenta Informaticae

Volumn 82, Issue 1-2, 2008, Pages 141-153

  Kučera, Antonín ^a   Straovský, Oldich ^a  

^a MASARYK UNIVERSITY   (Czech Republic)

Author keywords

Controller synthesis; Markov decision process; PCTL

Indexed keywords

ALGORITHMS; DECISION MAKING; MARKOV PROCESSES; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING;

CONTROLLER SYNTHESIS; MARKOV DECISION PROCESS;

CONTROL SYSTEMS;

EID: 38349092981     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (18)

1. C. Baier, T. Brázdil, M. Größer, and A. Kučera. Stochastic game logic. In Proceedings of 4th Int. Conf. on Quantitative Evaluation of Systems (QEST'07). IEEE Computer Society Press, 2007.
2. C. Baier, M. Größer, M. Leucker, B. Bollig, and F. Ciesinski. Controller synthesis for probabilistic systems. In Proceedings of IFIP TCS'2004, pages 493-506. Kluwer, 2004.
3. P. Bouyer, D. D'Souza, P. Madhusudan, and A. Petit. Timed control with partial observability. In Proceedings of CAV 2003, volume 2725 of Lecture Notes in Computer Science, pages 180-192. Springer, 2003.
4. T. Brázdil, V. Brožek, V. Forejt, and A. Kučera. Stochastic games with branching-time winning objectives. In Proceedings of LICS 2006, pages 349-358. IEEE Computer Society Press, 2006.
5. K. Chatterjee and T. Henzinger. Semiperfect-information games. In Proceedings of FST&TCS 2005, volume 3821 of Lecture Notes in Computer Science, pages 1-18. Springer, 2005.
6. C. Courcoubetis and M. Yannakakis. The complexity of probabilistic verification. Journal of the Association for Computing Machinery, 42(4):857-907, 1995.
7. L. de Alfaro. How to specify and verify the long-run average behavior of probabilistic systems. In Proceedings of LICS'98, pages 454-465. IEEE Computer Society Press, 1998.
8. L. de Alfaro, M. Faella, T. Henzinger, R. Majumdar, and M. Stoelinga. The element of surprise in timed games. In Proceedings of CONCUR 2003, volume 2761 of Lecture Notes in Computer Science, pages 144-158. Springer, 2003.
9. D. Grigoriev. Complexity of deciding Tarski algebra. Journal of Symbolic Computation, 5(1-2):65-108, 1988.
10. H. Hansson and B. Jonsson. A logic for reasoning about time and reliability. Formal Aspects of Computing, 6:512-535, 1994.
11. A. Kučera and O. Stražovský. On the controller synthesis for finite-state Markov decision processes. In Proceedings of FST&TCS 2005, volume 3821 of Lecture Notes in Computer Science, pages 541-552. Springer, 2005.
12. K. Larsen and A. Skou. Bisimulation through probabilistic testing. Information and Computation, 94(1):1-28, 1991.
13. A. Nilim and L. El Ghaoui. Robustness in Markov decision problems with uncertain transition matrices. In Proceedings of NIPS 2003. MIT Press, 2003.
14. M.L. Puterman. Markov Decision Processes. Wiley, 1994.
15. R. Segala and N.A. Lynch. Probabilistic simulations for probabilistic processes. Nordic Journal of Computing, 2(2):250-273, 1995.
16. A. Tarski. A Decision Method for Elementary Algebra and Geometry. Univ. of California Press, Berkeley, 1951.
17. W. Thomas. Infinite games and verification. In Proceedings of CAV 2003, volume 2725 of Lecture Notes in Computer Science, pages 58-64. Springer, 2003.
18. U. Zwick and M. Paterson. The complexity of mean payoff games on graphs. Theoretical Computer Science, 158(1-2):343-359, 1996.