Rajeev Alur
Salvatore La Torre
P. Madhusudan
2003
Playing Games with Boxes and Diamonds
Roberto Amadio
Denis Lugiez
CONCUR 2003 - Concurrency Theory
Lecture Notes in Computer Science
2761
Springer Berlin Heidelberg
128–143
10.1007/978-3-540-45187-7_8
K. Apt
E. Grädel
2011
Lectures in Game Theory for Computer Scientists
Cambridge University Press
Krishnendu Chatterjee
2007
Stochastic Omega-Regular Games
EECS Department, University of California, Berkeley
http://chess.eecs.berkeley.edu/pubs/462.html
Jacques Duparc
Alessandro Facchini
Filip Murlak
2011
Definable Operations On Weakly Recognizable Sets of Trees
Supratik Chakraborty
Amit Kumar
FSTTCS
LIPIcs
13
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik
363–374
10.4230/LIPIcs.FSTTCS.2011.363
Alessandro Facchini
Filip Murlak
Michal Skrzypczak
2013
Rabin-Mostowski Index Problem: A Step beyond Deterministic Automata
LICS
IEEE Computer Society
499–508
10.1109/LICS.2013.56
Marcin Jurdzinski
1998
Deciding the Winner in Parity Games is in UP co-UP
Inf. Process. Lett.
68
3
119–124
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
267 – 276
10.1016/0304-3975(87)90133-2
A. Pnueli
R. Rosner
1989
On the Synthesis of a Reactive Module
Proceedings of the 16th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
POPL '89
ACM
New York, NY, USA
179–190
10.1145/75277.75293
Moshe Y. Vardi
1996
An automata-theoretic approach to linear temporal logic
Faron Moller
Graham Birtwistle
Logics for Concurrency
Lecture Notes in Computer Science
1043
Springer Berlin Heidelberg
238–266
10.1007/3-540-60915-6_6