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.
D. Berwanger & E. Grädel (2001):
Games and Model Checking for Guarded Logics.
In: LPAR,
LNCS 2250.
Springer,
pp. 70–84,
doi:10.1007/3-540-45653-8_5.
T. Chen, B. Ploeger, J. van de Pol & T.A.C. Willemse (2007):
Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems.
In: CONCUR'07,
pp. 120–135,
doi:10.1007/978-3-540-74407-8_9.
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 (2001):
On model checking for the μ-calculus and its fragments.
Theor. Comput. Sci. 258(1-2),
pp. 491–522,
doi:10.1016/S0304-3975(00)00034-7.
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'09,
LNCS 5799.
Springer,
pp. 182–196,
doi:10.1007/978-3-642-04761-9_15.
J.F. Groote & M. Keinänen (2005):
A Sub-quadratic Algorithm for Conjunctive and Disjunctive Boolean Equation Systems.
In: ICTAC,
LNCS 3722.
Springer,
pp. 532–545,
doi:10.1007/11560647_35.
M. Jurdziński (1998):
Deciding the Winner in Parity Games is in UP co-UP.
IPL 68(3),
pp. 119–124,
doi:10.1016/S0020-0190(98)00150-1.
M. Jurdziński (2000):
Small Progress Measures for Solving Parity Games.
In: STACS'00,
LNCS 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.
J.J.A. Keiren (2009):
An experimental study of algorithms and optimisations for parity games, with an application to Boolean Equation Systems.
Eindhoven University of Technology.
V. King, O. Kupferman & M.Y. Vardi (2001):
On the Complexity of Parity Word Automata.
In: FoSSaCS,
LNCS 2030.
Springer,
pp. 276–286,
doi:10.1007/3-540-45315-6_18.
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,
LNCS 4855.
Springer,
pp. 449–460,
doi:10.1007/978-3-540-77050-3.
R.E. Tarjan (1972):
Depth-First Search and Linear Graph Algorithms.
SIAM J. Comput. 1(2),
pp. 146–160,
doi:10.1137/0201010.
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