Controller synthesis and verification for Markov decision processes with qualitative branching time objectives

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5126 LNCS, Issue PART 2, 2008, Pages 148-159

  Brázdil, Tomáš ^a   Forejt, Vojtěch ^a   Kučera, Antonín ^a  

^a MASARYK UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

CHLORINE COMPOUNDS; LEARNING ALGORITHMS; LINGUISTICS; TRANSLATION (LANGUAGES);

BRANCHING TIME; COMPLEXITY BOUNDS; CONTROLLER SYNTHESIS; MARKOV DECISION PROCESS; MARKOV DECISION PROCESSES; VERIFICATION PROBLEMS;

MARKOV PROCESSES;

EID: 49049120820     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70583-3_13     Document Type: Conference Paper

References (19)

1. Baier, C., Größer, M., Leucker, M., Bollig, B., Ciesinski, F.: Controller synthesis for probabilistic systems. In: Proceedings of IFIP TCS 2004, pp. 493-506. Kluwer, Dordrecht (2004)
2. Brázdil, T., Brožek, V., Forejt, V.: Branching-time model-checking of probabilistic pushdown automata. In: Proceedings of INFINITY 2007, pp. 24-33 (2007)
3. Brázdil, T., Brožek, V., Forejt, V., Kučera, A.: Stochastic games with branching-time winning objectives. In: Proceedings of LICS 2006, pp. 349-358. IEEE, Los Alamitos (2006)
4. Brázdil, T., Forejt, V.: Strategy synthesis for Markov decision processes and branching-time logics. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR. LNCS, vol. 4703, pp. 428-444. Springer, Heidelberg (2007)
5. Brázdil, T., Forejt, V., Kučera, A.: Controller synthesis and verification for Markov decision processes with qualitative branching time objectives. Technical report FIMU-RS-2008-05, Faculty of Informatics, Masaryk University (2008)
6. Chatterjee, K., de Alfaro, L., Henzinger, T.: Trading memory for randomness. In: Proceedings of 2nd Int. Conf. on Quantitative Evaluation of Systems (QEST 2004), pp. 206-217. IEEE, Los Alamitos (2004)
7. Chatterjee, K., Majumdar, R., Henzinger, T.: Markov decision processes with multiple objectives. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 325-336. Springer, Heidelberg (2006)
8. de Alfaro, L.: Quantitative verification and control via the mu-calculus. In: Amadio, R.M., Lugiez,D. (eds.)CONCUR2003.LNCS, vol. 2761, pp. 102-126. Springer,Heidelberg (2003)
9. Emerson, E.A.: Temporal and modal logic. Handbook of TCS B, 995-1072 (1991)
10. Etessami, K., Kwiatkowska, M., Vardi, M., Yannakakis, M.: Multi-objective model checking of Markov decision processes. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 50-65. Springer, Heidelberg (2007)
11. Filar, J., Vrieze, K.: Competitive Markov Decision Processes. Springer, Heidelberg (1996)
12. Grädel, E.: Positional determinacy of infinite games. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol. 2996, pp. 4-18. Springer, Heidelberg (2004)
13. Hansson, H., Jonsson, B.: A logic for reasoning about time and reliability. Formal Aspects of Computing 6, 512-535 (1994)
14. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)
15. Kučera, A., Stražovský, O.: On the controller synthesis for finite-state Markov decision processes. In: Proceedings of FST&TCS 2005. LNCS, vol. 3821, pp. 541-552. Springer, Heidelberg (2005)
16. Puterman, M.L.: Markov Decision Processes. Wiley, Chichester (1994)
17. Stirling, C.:Modal and temporal logics. Handbook of Logic in Comp. Sci. 2, 477-563 (1992)
18. Vardi, M.: Automatic verification of probabilistic concurrent finite-state programs. In: Proceedings of FOCS 1985, pp. 327-338. IEEE, Los Alamitos (1985)
19. Walukiewicz, I.: A landscape with games in the background. In: Proceedings of LICS 2004, pp. 356-366. IEEE, Los Alamitos (2004)