Julien Bernet, David Janin & Igor Walukiewicz (2002):
Permissive strategies: from parity games to safety games.
ITA 36(3),
pp. 261–275,
doi:10.1051/ita:2002013.
Roderick Bloem, Krishnendu Chatterjee, Thomas A. Henzinger & Barbara Jobstmann (2009):
Better Quality in Synthesis through Quantitative Objectives.
In: Ahmed Bouajjani & Oded Maler: CAV,
LNCS 5643.
Springer,
pp. 140–156,
doi:10.1007/978-3-642-02658-4_14.
Patricia Bouyer, Nicolas Markey, Jörg Olschewski & Michael Ummels (2011):
Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited.
In: Bultan & Hsiung,
pp. 135–149,
doi:10.1007/978-3-642-24372-1_11.
Tevfik Bultan & Pao-Ann Hsiung (2011):
Automated Technology for Verification and Analysis, 9th International Symposium, ATVA 2011, Taipei, Taiwan, October 11-14, 2011. Proceedings.
Lecture Notes in Computer Science 6996.
Springer,
doi:10.1007/978-3-642-24372-1.
Pavol Cerný, Krishnendu Chatterjee, Thomas A. Henzinger, Arjun Radhakrishna & Rohit Singh (2011):
Quantitative Synthesis for Concurrent Programs.
In: Ganesh Gopalakrishnan & Shaz Qadeer: CAV,
LNCS 6806.
Springer,
pp. 243–259,
doi:10.1007/978-3-642-22110-1_20.
Chih-Hong Cheng, Alois Knoll, Michael Luttenberger & Christian Buckl (2011):
GAVS+: An Open Platform for the Research of Algorithmic Game Solving.
In: Parosh Aziz Abdulla & K. Rustan M. Leino: TACAS,
LNCS 6605.
Springer,
pp. 258–261,
doi:10.1007/978-3-642-19835-9_22.
Stefan Dziembowski, Marcin Jurdziński & Igor Walukiewicz (1997):
How Much Memory is Needed to Win Infinite Games?.
In: LICS.
IEEE Computer Society,
pp. 99–110,
doi:10.1109/LICS.1997.614939.
Ruediger Ehlers (2011):
Small witnesses, accepting lassos and winning strategies in omega-automata and games.
CoRR abs/1108.0315.
Available at http://arxiv.org/abs/1108.0315.
John Fearnley & Martin Zimmermann (2012):
Playing Muller Games in a Hurry.
Int. J. Found. Comput. Sci. 23(3),
pp. 649–668,
doi:10.1142/S0129054112400321.
Emmanuel Filiot, Naiyong Jin & Jean-François Raskin (2011):
Antichains and compositional algorithms for LTL synthesis.
Formal Methods in System Design 39(3),
pp. 261–296,
doi:10.1007/s10703-011-0115-3.
Yuri Gurevich & Leo Harrington (1982):
Trees, Automata, and Games.
In: STOC.
ACM,
pp. 60–65.
Florian Horn (2008):
Explicit Muller Games are PTIME.
In: Ramesh Hariharan, Madhavan Mukund & V. Vinay: FSTTCS,
LIPIcs 2.
Schloss Dagstuhl – Leibniz-Zentrum für Informatik,
pp. 235–243,
doi:10.4230/LIPIcs.FSTTCS.2008.1756.
Florian Horn, Wolfgang Thomas & Nico Wallmeier (2008):
Optimal Strategy Synthesis in Request-Response Games.
In: Sung Deok Cha, Jin-Young Choi, Moonzoo Kim, Insup Ldoi & Mahesh Viswanathan: ATVA,
LNCS 5311.
Springer,
pp. 361–373,
doi:10.1007/978-3-540-88387-6_31.
Marcin Jurdziński (2000):
Small Progress Measures for Solving Parity Games.
In: Horst Reichel & Sophie Tison: STACS,
LNCS 1770.
Springer,
pp. 290–301,
doi:10.1007/3-540-46541-3_24.
Alexander Kechris (1995):
Classical Descriptive Set Theory.
Graduate Texts in Mathematics 156.
Springer.
Orna Kupferman & Moshe Y. Vardi (2005):
Safraless Decision Procedures.
In: FOCS.
IEEE Computer Society,
pp. 531–542,
doi:10.1109/SFCS.2005.66.
Robert McNaughton (1993):
Infinite Games Played on Finite Graphs.
Ann. Pure Appl. Logic 65(2),
pp. 149–184,
doi:10.1016/0168-0072(93)90036-D.
Robert McNaughton (2000):
Playing Infinite Games in Finite Time.
In: Arto Salomaa, Derick Wood & Sheng Yu: A Half-Century of Automata Theory.
World Scientific,
pp. 73–91.
Daniel Neider (2011):
Small Strategies for Safety Games.
In: Bultan & Hsiung,
pp. 306–320,
doi:10.1007/978-3-642-24372-1_22.
Sven Schewe & Bernd Finkbeiner (2007):
Bounded Synthesis.
In: Kedar S. Namjoshi, Tomohiro Yoneda, Teruo Higashino & Yoshio Okamura: ATVA,
LNCS 4762.
Springer,
pp. 474–488,
doi:10.1007/978-3-540-75596-8_33.
Nico Wallmeier, Patrick Hütten & Wolfgang Thomas (2003):
Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications.
In: Oscar H. Ibarra & Zhe Dang: CIAA,
LNCS 2759.
Springer,
pp. 11–22,
doi:10.1007/3-540-45089-0_3.
Wiesław Zielonka (1998):
Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees.
Theor. Comput. Sci. 200(1-2),
pp. 135–183,
doi:10.1016/S0304-3975(98)00009-7.
Martin Zimmermann (2009):
Time-Optimal Winning Strategies for Poset Games.
In: Sebastian Maneth: CIAA,
LNCS 5642.
Springer,
pp. 217–226,
doi:10.1007/978-3-642-02979-0_25.
eptcs@eptcs.org