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