1. Julien Bernet, David Janin & Igor Walukiewicz (2002): Permissive strategies: from parity games to safety games. ITA 36(3), pp. 261–275, doi:10.1051/ita:2002013.
  2. E. Allen Emerson & Charanjit S. Jutla (1991): Tree Automata, Mu-Calculus and Determinacy (Extended Abstract). In: FOCS. IEEE Computer Society, pp. 368–377, doi:10.1109/SFCS.1991.185392.
  3. John Fearnley & Martin Zimmermann (2012): Playing Muller Games in a Hurry. Int. J. Found. Comput. Sci. 23(3), pp. 649–668, doi:10.1142/S0129054112400321.
  4. Marcin Jurdziński (2000): Small Progress Measures for Solving Parity Games. In: Horst Reichel & Sophie Tison: STACS, Lecture Notes in Computer Science 1770. Springer, pp. 290–301, doi:10.1007/3-540-46541-3_24.
  5. Christof Löding, P. Madhusudan & Olivier Serre (2004): Visibly Pushdown Games. In: Kamal Lodaya & Meena Mahajan: FSTTCS, Lecture Notes in Computer Science 3328. Springer, pp. 408–420, doi:10.1007/978-3-540-30538-5_34.
  6. Robert McNaughton (2000): Playing Infinite Games in Finite Time. In: Arto Salomaa, Derick Wood & Sheng Yu: A Half-Century of Automata Theory. World Scientific, pp. 73–91.
  7. Andrzej W. Mostowski (1991): Games with forbidden positions. Technical Report 78. University of Gdansk.
  8. Daniel Neider, Roman Rabinovich & Martin Zimmermann (2012): Down the Borel-Hierarchy: Solving Muller Games via Safety Games. In: Marco Faella & Aniello Murano: GandALF 2012, EPTCS. To appear.
  9. Igor Walukiewicz (1996): Pushdown Processes: Games and Model Checking. In: Rajeev Alur & Thomas A. Henzinger: CAV, Lecture Notes in Computer Science 1102. Springer, pp. 62–74, doi:10.1007/3-540-61474-5_58.

Comments and questions to:
For website issues: