Rajeev Alur, Kousha Etessami, Salvatore La Torre & Doron A. Peled (2001):
Parametric temporal logic for "model measuring".
ACM Trans. Comput. Log. 2(3),
pp. 388–407,
doi:10.1145/377978.377990.
Henrik Björklund & Sergei G. Vorobyov (2007):
A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games.
Discret. Appl. Math. 155(2),
pp. 210–229,
doi:10.1016/j.dam.2006.04.029.
Roderick Bloem, Krishnendu Chatterjee, Thomas A. Henzinger & Barbara Jobstmann (2009):
Better Quality in Synthesis through Quantitative Objectives.
In: CAV 2009,
LNCS 5643.
Springer,
pp. 140–156,
doi:10.1007/978-3-642-02658-4_14.
Patricia Bouyer, Nicolas Markey, Mickael Randour, Kim G. Larsen & Simon Laursen (2018):
Average-energy games.
Acta Informatica 55(2),
pp. 91–127,
doi:10.1007/s00236-016-0274-1.
Tomás Brázdil, Krishnendu Chatterjee, Antonín Kucera & Petr Novotný (2012):
Efficient Controller Synthesis for Consumption Games with Multiple Resource Types.
In: P. Madhusudan & Sanjit A. Seshia: CAV 2012,
LNCS 7358.
Springer,
pp. 23–38,
doi:10.1007/978-3-642-31424-7_8.
Thomas Brihaye, Gilles Geeraerts, Axel Haddad & Benjamin Monmege (2015):
To Reach or not to Reach? Efficient Algorithms for Total-Payoff Games.
In: Luca Aceto & David de Frutos-Escrig: CONCUR 2015,
LIPIcs 42.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
pp. 297–310,
doi:10.4230/LIPIcs.CONCUR.2015.297.
Véronique Bruyère, Emmanuel Filiot, Mickael Randour & Jean-François Raskin (2017):
Meet your expectations with guarantees: Beyond worst-case synthesis in quantitative games.
Inf. Comput. 254,
pp. 259–295,
doi:10.1016/j.ic.2016.10.011.
J. Richard Büchi & Lawrence H. Landweber (1969):
Solving Sequential Conditions by Finite-State Strategies.
Trans. Amer. Math. Soc. 138,
pp. pp. 295–311,
doi:10.2307/1994916.
Thierry Cachat (2002):
Symbolic Strategy Synthesis for Games on Pushdown Graphs.
In: ICALP 2002,
LNCS 2380.
Springer,
pp. 704–715,
doi:10.1007/3-540-45465-9_60.
Arnaud Carayol & Matthew Hague (2018):
Optimal Strategies in Pushdown Reachability Games.
In: MFCS 2018,
LIPIcs 117.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
pp. 42:1–42:14,
doi:10.4230/LIPIcs.MFCS.2018.42.
Krishnendu Chatterjee & Laurent Doyen (2012):
Energy parity games.
Theor. Comput. Sci. 458,
pp. 49–60,
doi:10.1016/j.tcs.2012.07.038.
Krishnendu Chatterjee, Thomas A. Henzinger & Florian Horn (2009):
Finitary winning in omega-regular games.
ACM Trans. Comput. Log. 11(1),
pp. 1:1–1:27,
doi:10.1145/1614431.1614432.
Krishnendu Chatterjee, Thomas A. Henzinger & Marcin Jurdzinski (2005):
Mean-Payoff Parity Games.
In: LICS 2005.
IEEE Computer Society,
pp. 178–187,
doi:10.1109/LICS.2005.26.
Krishnendu Chatterjee, Thomas A. Henzinger & Nir Piterman (2008):
Algorithms for Büchi Games.
arXiv 0805.2620.
Available at http://arxiv.org/abs/0805.2620.
Krishnendu Chatterjee, Mickael Randour & Jean-François Raskin (2014):
Strategy synthesis for multi-dimensional quantitative objectives.
Acta Informatica 51(3-4),
pp. 129–163,
doi:10.1007/s00236-013-0182-6.
Alonzo Church (1963):
Logic, arithmetic, and automata.
In: Proc. Int. Congr. Math. 1962.
Inst. Mittag-Lefler, Djursholm, Sweden,
pp. 23–35.
L. Doyen & J.-F. Raskin (2011):
Games with Imperfect Information: Theory and Algorithms.
In: Lectures in Game Theory for Computer Scientists.
Cambridge University Press,
pp. 185–212,
doi:10.1017/CBO9780511973468.007.
Andrzej Ehrenfeucht & Jan Mycielski (1979):
Positional strategies for mean payoff games.
Int. J. Game Theory 8,
pp. 109–113,
doi:10.1007/BF01768705.
Peter Faymonville & Martin Zimmermann (2017):
Parametric Linear Dynamic Logic.
Inf. Comput. 253,
pp. 237–256,
doi:10.1016/j.ic.2016.07.009.
Nathanaël Fijalkow & Martin Zimmermann (2014):
Parity and Streett Games with Costs.
Log. Methods Comput. Sci. 10(2),
doi:10.2168/LMCS-10(2:14)2014.
Bernd Finkbeiner (2016):
Synthesis of Reactive Systems.
In: Javier Esparza, Orna Grumberg & Salomon Sickert: Dependable Software Systems Engineering,
NATO Science for Peace and Security Series - D: Information and Communication Security 45.
IOS Press,
pp. 72–98,
doi:10.3233/978-1-61499-627-9-72.
Hugo Gimbert & Wieslaw Zielonka (2004):
When Can You Play Positionally?.
In: JiríFiala, Václav Koubek & Jan Kratochvíl: MFCS 2004,
LNCS 3153.
Springer,
pp. 686–697,
doi:10.1007/978-3-540-28629-5_53.
Erich Grädel, Wolfgang Thomas & Thomas Wilke (2002):
Automata, Logics, and Infinite Games: A Guide to Current Research.
LNCS 2500.
Springer,
doi:10.1007/3-540-36387-4.
Line Juhl, Kim Guldstrand Larsen & Jean-François Raskin (2013):
Optimal Bounds for Multiweighted and Parametrised Energy Games.
In: Zhiming Liu, Jim Woodcock & Huibiao Zhu: Theories of Programming and Formal Methods - Essays Dedicated to Jifeng He on the Occasion of His 70th Birthday,
LNCS 8051.
Springer,
pp. 244–255,
doi:10.1007/978-3-642-39698-4_15.
Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Gábor Rudolf & Jihui Zhao (2008):
On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction.
Theory Comput. Syst. 43(2),
pp. 204–233,
doi:10.1007/s00224-007-9025-6.
Orna Kupferman, Nir Piterman & Moshe Y. Vardi (2009):
From liveness to promptness.
Formal Methods Syst. Des. 34(2),
pp. 83–103,
doi:10.1007/s10703-009-0067-z.
Lawrence H. Landweber (1969):
Decision Problems for omega-Automata.
Math. Syst. Theory 3(4),
pp. 376–384,
doi:10.1007/BF01691063.
Aniello Murano, Sasha Rubin & Martin Zimmermann (2020):
Optimal Strategies in Weighted Limit Games (full version).
arXiv 2008.11562.
Available at https://arxiv.org/abs/2008.11562.
Amir Pnueli (1977):
The Temporal Logic of Programs.
In: FOCS 1977.
IEEE Computer Society,
pp. 46–57,
doi:10.1109/SFCS.1977.32.
Anuj Puri (1995):
Theory of hybrid systems and discrete event systems.
Computer Science Department, University of California, Berkeley.
Sven Schewe, Alexander Weinert & Martin Zimmermann (2019):
Parity Games with Weights.
Log. Methods Comput. Sci. 15(3),
doi:10.23638/LMCS-15(3:20)2019.
Olivier Serre (2006):
Parity Games Played on Transition Graphs of One-Counter Processes.
In: FOSSACS 2006,
LNCS 3921.
Springer,
pp. 337–351,
doi:10.1007/11690634_23.
Frank Thuijsman & Otto J. Vrieze (1987):
The bad match; A total reward stochastic game.
OR Spektrum 9(2),
pp. 93–99,
doi:10.1007/BF01732644.
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 2003,
LNCS 2759.
Springer,
pp. 11–22,
doi:10.1007/3-540-45089-0_3.
Alexander Weinert & Martin Zimmermann (2017):
Easy to Win, Hard to Master: Optimal Strategies in Parity Games with Costs.
Log. Methods Comput. Sci. 13(3),
doi:10.23638/LMCS-13(3:29)2017.
Martin Zimmermann (2013):
Optimal bounds in parametric LTL games.
Theor. Comput. Sci. 493,
pp. 30–45,
doi:10.1016/j.tcs.2012.07.039.
Martin Zimmermann (2018):
Parameterized linear temporal logics meet costs: still not costlier than LTL.
Acta Informatica 55(2),
pp. 129–152,
doi:10.1007/s00236-016-0279-9.
Uri Zwick & Mike Paterson (1996):
The Complexity of Mean Payoff Games on Graphs.
Theor. Comput. Sci. 158(1&2),
pp. 343–359,
doi:10.1016/0304-3975(95)00188-3.