Continuous-time stochastic games with time-bounded reachability

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 4, Issue , 2009, Pages 61-72

  Brazdil, T ^a   Forejt, V ^a   Krcal J ^a   Kretinsky J ^a   Kucera A ^a  

^a MASARYK UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEXITY ESTIMATION; CONTINUOUS-TIME; OPTIMAL STRATEGIES; STOCHASTIC GAME; TIME-BOUNDED REACHABILITY;

GAME THEORY; OPTIMAL SYSTEMS; SOFTWARE ENGINEERING;

CONTINUOUS TIME SYSTEMS;

EID: 84880243790     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.FSTTCS.2009.2307     Document Type: Conference Paper

References (11)

1. C. Baier, B.R. Haverkort, H. Hermanns, and J.-P. Katoen. Reachability in continuous-time Markov reward decision processes. In E. Graedel, J. Flum, and T. Wilke, editors, Logic and Automata: History and Perspectives, Volume 2 of Texts in Logics and Games, pages 53-72. Amsterdam University Press, 2008.
2. C. Baier, H. Hermanns, J.-P. Katoen, and B.R. Haverkort. Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes. TCS, 345: 2-26, 2005.
3. T. Brázdil, V. Forejt, J. Krčál, J. Křetínský, and A. Kučera. Continuous-time stochastic games with time-bounded reachability. Technical report FIMU-RS-2009-09, Faculty of Informatics, Masaryk University, Brno, 2009.
4. J. Filar and K. Vrieze. Competitive Markov Decision Processes. Springer, 1996.
5. E. Grädel, W. Thomas, and T. Wilke. Automata, Logics, and Infinite Games. Number 2500 in LNCS. Springer, 2002.
6. D.A. Martin. The determinacy of Blackwell games. JSL, 63(4): 1565-1581, 1998.
7. M. Neuhäußer, M. Stoelinga, and J.-P. Katoen. Delayed nondeterminism in continuous-time Markov decision processes. In Proceedings of FoSSaCS 2009, Volume 5504 of LNCS, pages 364-379. Springer, 2009.
8. J.R. Norris. Markov Chains. Cambridge University Press, 1998.
9. M.L. Puterman. Markov Decision Processes. Wiley, 1994.
10. W. Thomas. Infinite games and verification. In Proceedings of CAV 2003, Volume 2725 of LNCS, pages 58-64. Springer, 2003.
11. I. Walukiewicz. A landscape with games in the background. In Proceedings of LICS 2004, pages 356-366. IEEE, 2004.