Skip to main content
SpringerLink
Log in
Book cover

Annual Symposium on Theoretical Aspects of Computer Science

STACS 2004: STACS 2004 pp 4–18Cite as

Positional Determinacy of Infinite Games

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2996))

Abstract

We survey results on determinacy of games and on the existence of positional winning strategies for parity games and Rabin games. We will then discuss some new developments concerning positional determinacy for path games and for Muller games with infinitely many priorities.

This research has been partially supported by the European Community Research Training Network “Games and Automata for Synthesis and Validation” (games)

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berwanger, D., Grädel, E., Kreutzer, S.: Once upon a time in the west, Determinacy, complexity and definability of path games. In: Y. Vardi, M., Voronkov, A. (eds.) LPAR 2003. LNCS, vol. 2850, pp. 226–240. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  2. Bouquet, A., Serre, O., Walukiewicz, I.: Pushdown games with unboundedness and regular conditions (submitted for publication)

    Google Scholar 

  3. Cachat, T., Duparc, J., Thomas, W.: Solving pushdown games with a σ 3 winning cndition. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol. 2471, pp. 322–336. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  4. Dziembowski, S., Jurdziński, M., Walukiewicz, I.: How much memory is needed to win infinite games? In: Proceedings of 12th Annual IEEE Symposium on Logic in Computer Science (LICS 1997), pp. 99–110 (1997)

    Google Scholar 

  5. Emerson, A., Jutla, C.: Tree automata, mu-calculus and determinacy. In: Proc. 32nd IEEE Symp. on Foundations of Computer Science, pp. 368–377 (1991)

    Google Scholar 

  6. Grädel, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games. LNCS, vol. 2500. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  7. Grädel, E., Walukiewicz, I.: Positional determinacy of games with infinitely many priorities (submitted for publication)

    Google Scholar 

  8. Gurevich, Y., Harrington, L.: Trees, automata and games. In: Proceedings of the 14th Annual ACM Symposium on Theory of Computing, STOC 1982, pp. 60–65 (1982)

    Google Scholar 

  9. Kanamori, A.: The Higher Infinite. Springer, Heidelberg (1991)

    Google Scholar 

  10. Kechris, A.: Classical Descriptive Set Theory. Springer, Heidelberg (1995)

    MATH  Google Scholar 

  11. Klarlund, N.: Progress measures, immediate determinacy, and a subset construction for tree automata. Annals of Pure and Applied Logic 69, 243–268 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  12. Leone, S.: The Good, the Bad and the Ugly, with Clint Eastwood, Eli Wallach, Lee Van Cleef et al. (1966)

    Google Scholar 

  13. Leone, S.: Once Upon a Time in the West, with Charles Bronson, Claudia Cardinale, Henry Fonda et al. (1969)

    Google Scholar 

  14. Martin, D.: Borel determinacy. Annals of Mathematics 102, 336–371 (1975)

    Article  Google Scholar 

  15. Mauldin, R. (ed.): The Scottish Book. Mathematics from the Scottish Café. Birkhäuser, Basel (1981)

    MATH  Google Scholar 

  16. Mostowski, A.: Games with forbidden positions, Tech. Rep. Tech. Report 78, University of Gdansk (1991)

    Google Scholar 

  17. Pistore, M., Vardi, M.: The planning spectrum — one, two, three, infinity. In: Proc. 18th IEEE Symp. on Logic in Computer Science (2003)

    Google Scholar 

  18. Swift, J.: Gulliver’s Travels. George Routledge & Sons, London (1906) (first published in 1726)

    Google Scholar 

  19. Thomas, W.: On the synthesis of strategies in infinite games. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol. 900, pp. 1–13. Springer, Heidelberg (1995)

    Google Scholar 

  20. Thomas, W.: Languages, automata, and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 3, pp. 389–455. Springer, Heidelberg (1997)

    Google Scholar 

  21. Zermelo, E.: Über eine Anwendung der Mengenlehre auf die Theorie des Schachpiels. In: Proc. 5th Internat. Congr. Mathematics, Cambridge, vol. 2, pp. 501–504 (1913)

    Google Scholar 

  22. Zielonka, W.: Infinite games on finitely coloured graphs with applications to automata on infinite trees. Theoretical Computer Science 200, 135–183 (1998)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Aachen University,  

    Erich Grädel

Authors
  1. Erich Grädel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Universität Stuttgart, FMI, Germany

    Volker Diekert

  2. LIAFA and the University of Paris 7, Denis Diderot,  

    Michel Habib

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Grädel, E. (2004). Positional Determinacy of Infinite Games. In: Diekert, V., Habib, M. (eds) STACS 2004. STACS 2004. Lecture Notes in Computer Science, vol 2996. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24749-4_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24749-4_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21236-2

  • Online ISBN: 978-3-540-24749-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation