Stochastic Games with Finitary Objectives

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

Volumn 5734 LNCS, Issue , 2009, Pages 34-54

  Chatterjee, Krishnendu ^a   Henzinger, Thomas A ^b   Horn, Florian ^c  

^a INSTITUTE OF SCIENCE AND TECHNOLOGY AUSTRIA   (Austria)

^b EPFL   (Switzerland)

^c CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

GAME GRAPHS; GRAPH GAMES; LIVENESS; OPTIMAL STRATEGIES; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; PROBABILISTIC CHOICES; REACTIVE SYSTEM; STOCHASTIC GAME;

COMPUTATION THEORY; GRAPH THEORY; POLYNOMIAL APPROXIMATION; SPECIFICATIONS;

GAME THEORY;

EID: 70349332752     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03816-7_4     Document Type: Conference Paper

References (17)

1. Alur, R., Henzinger, T.A.: Finitary fairness. In: LICS 1994, pp. 52-61. IEEE, Los Alamitos (1994)
2. Chatterjee, K.: Concurrent games with tail objectives. Theoretical Computer Science 388, 181-198 (2007)
3. Chatterjee, K., de Alfaro, L., Henzinger, T.A.: The complexity of stochastic Rabin and Streett games. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.3580, pp. 878-890. Springer, Heidelberg (2005)
4. Chatterjee, K., Henzinger, T.A.: Finitary winning in ù-regular games. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol.3920, pp. 257-271. Springer, Heidelberg (2006)
5. Chatterjee, K., Henzinger, T.A., Horn, F.: Finitary winning in ù-regular games. Technical Report: UCB/EECS-2007-2120 (2007)
6. Chatterjee, K., Jurdzínski, M., Henzinger, T.A.: Quantitative stochastic parity games. In: SODA 2004, pp. 121-130. SIAM, Philadelphia (2004)
7. de Alfaro, L., Henzinger, T.A.: Concurrent omega-regular games. In: LICS 2000, pp. 141-154. IEEE, Los Alamitos (2000)
8. Dziembowski, S., Jurdzinski, M., Walukiewicz, I.: How much memory is needed to win infinite games? In: LICS 1997, pp. 99-110. IEEE, Los Alamitos (1997)
9. Emerson, E.A., Jutla, C.: The complexity of tree automata and logics of programs. In: FOCS 1988, pp. 328-337. IEEE, Los Alamitos (1988)
10. Gurevich, Y., Harrington, L.: Trees, automata, and games. In: STOC 1982, pp. 60-65. ACM Press, New York (1982)
11. Horn, F.: Dicing on the streett. IPL 104, 1-9 (2007)
12. Horn, F.: Faster algorithms for finitary games. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol.4424, pp. 472-484. Springer, Heidelberg (2007)
13. Horn, F.: Random Games. PhD thesis, Université Denis-Diderot and RWTH, Aachen (2008)
14. Martin, D.A.: Borel determinacy. Annals of Mathematics 102(2), 363-371 (1975)
15. Martin, D.A.: The determinacy of Blackwell games. The Journal of Symbolic Logic 63(4), 1565-1581 (1998)
16. Piterman, N., Pnueli, A.: Faster solution of Rabin and Streett games. In: LICS 2006, pp. 275-284. IEEE, Los Alamitos (2006)
17. Zielonka, W.: Perfect-information stochastic parity games. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol.2987, pp. 499-513. Springer, Heidelberg (2004)