Rajeev Alur, Salvatore La Torre & P. Madhusudan (2003):
Playing Games with Boxes and Diamonds.
In: Roberto Amadio & Denis Lugiez: CONCUR 2003 - Concurrency Theory,
Lecture Notes in Computer Science 2761.
Springer Berlin Heidelberg,
pp. 128–143,
doi:10.1007/978-3-540-45187-7_8.
K. Apt & E. Grädel (2011):
Lectures in Game Theory for Computer Scientists.
Cambridge University Press.
Jacques Duparc, Alessandro Facchini & Filip Murlak (2011):
Definable Operations On Weakly Recognizable Sets of Trees.
In: Supratik Chakraborty & Amit Kumar: FSTTCS,
LIPIcs 13.
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik,
pp. 363–374,
doi:10.4230/LIPIcs.FSTTCS.2011.363.
Alessandro Facchini, Filip Murlak & Michal Skrzypczak (2013):
Rabin-Mostowski Index Problem: A Step beyond Deterministic Automata.
In: LICS.
IEEE Computer Society,
pp. 499–508,
doi:10.1109/LICS.2013.56.
Marcin Jurdzinski (1998):
Deciding the Winner in Parity Games is in UP co-UP.
Inf. Process. Lett. 68(3),
pp. 119–124,
doi:10.1016/S0020-0190(98)00150-1.
Christof Löding (2009):
Logic and Automata over Infinite Trees.
Habilitation,
RWTH Aachen, Germany.
Matteo Mio (2012):
Game Semantics for Probabilistic μ-Calculi.
University of Edinburgh.
David E. Muller & Paul E. Schupp (1987):
Alternating automata on infinite trees.
Theoretical Computer Science 54(23),
pp. 267 – 276,
doi:10.1016/0304-3975(87)90133-2.
A. Pnueli & R. Rosner (1989):
On the Synthesis of a Reactive Module.
In: Proceedings of the 16th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages,
POPL '89.
ACM,
New York, NY, USA,
pp. 179–190,
doi:10.1145/75277.75293.
Moshe Y. Vardi (1996):
An automata-theoretic approach to linear temporal logic.
In: Faron Moller & Graham Birtwistle: Logics for Concurrency,
Lecture Notes in Computer Science 1043.
Springer Berlin Heidelberg,
pp. 238–266,
doi:10.1007/3-540-60915-6_6.
eptcs@eptcs.org