A. Arnold, A. Vincent & I. Walukiewicz (2003):
Games for synthesis of controllers with partial observation.
TCS 303(1),
pp. 7–34,
doi:10.1016/S0304-3975(02)00442-5.
L. Brim, J. Chaloupka, L. Doyen, R. Gentilini & J.-F. Raskin (2011):
Faster algorithms for mean-payoff games.
Formal Methods in System Design 38(2),
pp. 97–118,
doi:10.1007/s10703-010-0105-x.
E.A. Emerson & C.S. Jutla (1991):
Tree automata, Mu-Calculus and determinacy.
In: FOCS'91.
IEEE Computer Society,
Washington, DC, USA,
pp. 368–377,
doi:10.1109/SFCS.1991.185392.
E.A. Emerson, C.S. Jutla & A.P. Sistla (1993):
On Model-Checking for Fragments of μ-Calculus.
In: CAV,
Lecture Notes in Computer Science 697.
Springer,
pp. 385–396,
doi:10.1007/3-540-56922-7_32.
J. Fearnley (2010):
Non-oblivious Strategy Improvement.
In: LPAR-16,
Lecture Notes in Computer Science 6355.
Springer,
pp. 212–230,
doi:10.1007/978-3-642-17511-4_13.
O. Friedmann (2011):
Recursive algorithm for parity games requires exponential time.
RAIRO – Theor. Inf. and Applic. 45(4),
pp. 449–457,
doi:10.1051/ita/2011124.
O. Friedmann & M. Lange (2009):
Solving Parity Games in Practice.
In: ATVA,
Lecture Notes in Computer Science 5799.
Springer,
pp. 182–196,
doi:10.1007/978-3-642-04761-9_15.
M. Gazda & T.A.C. Willemse (2013):
Zielonka's Recursive Algorithm: dull, weak and solitaire games and tighter bounds.
In: GandALF,
EPTCS 119,
pp. 7–20,
doi:10.4204/EPTCS.119.4.
M. Gazda & T.A.C. Willemse (2014):
Strategy Derivation for Small Progress Measures.
http://arxiv.org/abs/1407.2149.
E. Grädel, W. Thomas & T. Wilke (2002):
Automata, Logics, and Infinite Games: A Guide to Current Research.
Lecture Notes in Computer Science 2500.
Springer.
M. Jurdziński (2000):
Small Progress Measures for Solving Parity Games.
In: STACS'00,
Lecture Notes in Computer Science 1770.
Springer,
pp. 290–301,
doi:10.1007/3-540-46541-3_24.
M. Jurdziński, M. Paterson & U. Zwick (2006):
A Deterministic Subexponential Algorithm for Solving Parity Games.
In: SODA'06.
ACM/SIAM,
pp. 117–123,
doi:10.1145/1109557.1109571.
H. Klauck (2001):
Algorithms for Parity Games.
In: Automata, Logics, and Infinite Games: A Guide to Current Research, chapter 7,
Lecture Notes in Computer Science 2500.
Springer,
pp. 107–129,
doi:10.1007/3-540-36387-4_7.
R. McNaughton (1993):
Infinite games played on finite graphs.
APAL 65(2),
pp. 149–184,
doi:10.1016/0168-0072(93)90036-D.
S. Schewe (2007):
Solving Parity Games in Big Steps.
In: FSTTCS'07,
Lecture Notes in Computer Science 4855.
Springer,
pp. 449–460,
doi:10.1007/978-3-540-77050-3_37.
S. Schewe (2008):
An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games.
In: CSL,
Lecture Notes in Computer Science 5213.
Springer,
pp. 369–384,
doi:10.1007/978-3-540-87531-4_27.
S. Schewe, A. Trivedi & T. Varghese (2015):
Symmetric Strategy Improvement.
In: ICALP,
Lecture Notes in Computer Science 9135.
Springer,
pp. 388–400,
doi:10.1007/978-3-662-47666-6_31.
P. Stevens & C. Stirling (1998):
Practical Model Checking Using Games.
In: TACAS'98,
Lecture Notes in Computer Science 1384.
Springer,
pp. 85–101,
doi:10.1007/BFb0054166.
J. Vöge & M. Jurdziński (2000):
A Discrete Strategy Improvement Algorithm for Solving Parity Games.
In: CAV,
Lecture Notes in Computer Science 1855.
Springer,
pp. 202–215,
doi:10.1007/10722167_18.
W. Zielonka (1998):
Infinite games on finitely coloured graphs with applications to automata on infinite trees.
TCS 200(1-2),
pp. 135 – 183,
doi:10.1016/S0304-3975(98)00009-7.
eptcs@eptcs.org