On the controller synthesis for finite-state Markov decision processes

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

Volumn 3821 LNCS, Issue , 2005, Pages 541-552

  Kučera, Antonín ^a   Stražovský, Oldřich ^a  

^a MASARYK UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FINITE ELEMENT METHOD; FORMAL LOGIC; MARKOV PROCESSES; PROBABILITY; PROBLEM SOLVING; ROBUSTNESS (CONTROL SYSTEMS);

CONTROLLER SYNTHESIS; FINITE-STATE MARKOV DECISION; MDP; ROBUST CONTROLLERS;

DECISION THEORY;

EID: 33744933469     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11590156_44     Document Type: Conference Paper

References (12)

1. C. Baier, M. Größer, M. Leucker, B. Bollig, and F. Ciesinski. Controller synthesis for probabilistic systems. In Proceedings of IFIP TCS'2004. Kluwer, 2004.
2. P. Bouyer, D. D'Souza, P. Madhusudan, and A. Petit. Timed control with partial observability. In Proceedings of CAV 2003, vol. 2725 of LNCS, pp. 180-192. Springer, 2003.
3. C. Courcoubetis and M. Yannakakis. The complexity of probabilistic verification. JACM, 42(4):857-907, 1995.
4. L. de Alfaro. How to specify and verify the long-run average behavior of probabilistic systems. In Proceedings of LICS'98, pp. 454-465. IEEE, 1998.
5. L. de Alfaro, M. Faella, T. Henzinger, R. Majumdar, and M. Stoelinga. The element of surprise in timed games. In Proceedings of CONCUR 2003, vol. 2761 of LNCS, pp. 144-158. Springer, 2003.
6. D. Grigoriev. Complexity of deciding Tarski algebra. Journal of Symbolic Computation, 5(1-2):65-108, 1988.
7. H. Hansson and B. Jonsson. A logic for reasoning about time and reliability. Formal Aspects of Computing, 6:512-535, 1994.
8. A. Nilim and L. El Ghaoui. Robustness in markov decision problems with uncertain transition matrices. In Proceedings of NIPS 2003. MIT Press, 2003.
9. R. Segala and N.A. Lynch. Probabilistic simulations for probabilistic processes. NJC, 2(2):250-273, 1995.
10. A. Tarski. A Decision Method for Elementary Algebra and Geometry. Univ. of California Press, Berkeley, 1951.
11. W. Thomas. Infinite games and verification. In Proceedings of CAV 2003, vol. 2725 of LNCS, pp. 58-64. Springer, 2003.
12. U. Zwick and M. Paterson. The complexity of mean payoff games on graphs. TCS, 158(1&2):343-359, 1996.