Rajeev Alur, Kousha Etessami, Salvatore La Torre & Doron Peled (2001):
Parametric temporal logic for "model measuring".
ACM Trans. Comput. Log. 2(3),
pp. 388–407,
doi:10.1145/377978.377990.
R. Bloem, K. Chatterjee, T.A. Henzinger & B. Jobstmann (2009):
Better Quality in Synthesis through Quantitative Objectives.
In: Ahmed Bouajjani & Oded Maler: CAV 2009,
LNCS 5643.
Springer,
pp. 140–156,
doi:10.1007/978-3-642-02658-4_14.
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich & Kazuhisa Makino (2015):
Markov Decision Processes and Stochastic Games with Total Effective Payoff.
In: Ernst W. Mayr & Nicolas Ollinger: STACS 2015,
LIPIcs 30.
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik,
pp. 103–115,
doi:10.4230/LIPIcs.STACS.2015.103.
Patricia Bouyer, Uli Fahrenberg, Kim G. Larsen, Nicolas Markey & JiříSrba (2008):
Infinite runs in weighted timed automata with energy constraints.
In: Franck Cassez & Claude Jard: Formats 2008,
LNCS 5215.
Springer,
pp. 33–47,
doi:10.1007/978-3-540-85778-5_4.
Patricia Bouyer, Nicolas Markey, Mickael Randour, Kim G. Larsen & Simon Laursen (2015):
Average-energy games.
In: Javier Esparza & Enrico Tronci: GandALF 2015,
EPTCS 193.
Open Publishing Association,
pp. 1–15,
doi:10.4204/EPTCS.193.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.
Luboš Brim, Jakub Chaloupka, Laurent Doyen, Raffaella Gentilini & Jean-François Raskin (2011):
Faster algorithms for mean-payoff games.
Formal Methods in System Design 38(2),
pp. 97–118,
doi:10.1007/s10703-010-0105-x.
Franck Cassez, Jan J. Jensen, Kim G. Larsen, Jean-François Raskin & Pierre-Alain Reynier (2009):
Automatic Synthesis of Robust and Optimal Controllers – An Industrial Case Study.
In: Rupak Majumdar & Paulo Tabuada: HSCC 2009,
LNCS 5469.
Springer,
pp. 90–104,
doi:10.1007/978-3-642-00602-9_7.
Arindam Chakrabarti, Luca de Alfaro, Thomas A. Henzinger & Mariëlle Stoelinga (2003):
Resource Interfaces.
In: Rajeev Alur & Insup Lee: EMSOFT 2003,
LNCS 2855.
Springer,
pp. 117–133,
doi:10.1007/978-3-540-45212-6_9.
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 & Marcin Jurdziński (2005):
Mean-Payoff Parity Games.
In: LICS 2005.
IEEE Computer Society,
pp. 178–187,
doi:10.1109/LICS.2005.26.
Krishnendu Chatterjee, Mickael Randour & Jean-François Raskin (2013):
Strategy synthesis for multi-dimensional quantitative objectives.
Acta Informatica 51(3),
pp. 129–163,
doi:10.1007/s00236-013-0182-6.
A. Ehrenfeucht & J. Mycielski (1979):
Positional strategies for mean payoff games.
International Journal of Game Theory 8,
pp. 109–113,
doi:10.1007/BF01768705.
Daniel Ejsing-Dunn & Lisa Fontani (2013):
Infinite Runs in Recharge Automata.
Computer Science Department, Aalborg University, Denmark.
Available at http://www.cassting-project.eu/wp-content/uploads/master13-EF.pdf.
E. Allen Emerson & Charanjit S. Jutla (1991):
Tree Automata, Mu-Calculus and Determinacy (Extended Abstract).
In: FOCS 1991.
IEEE,
pp. 368–377,
doi:10.1109/SFCS.1991.185392.
Uli Fahrenberg, Line Juhl, Kim G. Larsen & JiříSrba (2011):
Energy Games in Multiweighted Automata.
In: Antonio Cerone & Pekka Pihlajasaari: ICTAC 2011,
LNCS 6916.
Springer,
pp. 95–115,
doi:10.1007/978-3-642-23283-1_9.
Peter Faymonville & Martin Zimmermann (2014):
Parametric Linear Dynamic Logic.
In: Adriano Peron & Carla Piazza: GandALF 2014,
EPTCS 161,
pp. 60–73,
doi:10.4204/EPTCS.161.8.
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 G. 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.
Marcin Jurdziński, Jeremy Sproston & François Laroussinie (2008):
Model Checking Probabilistic Timed Automata with One or Two Clocks.
LMCS 4(3),
doi:10.2168/LMCS-4(3:12)2008.
Dénes König (1927):
Über eine Schlussweise aus dem Endlichen ins Unendliche.
Acta Litt. ac. sci. Szeged 3,
pp. 121–130.
Orna Kupferman, Nir Piterman & Moshe Y. Vardi (2009):
From liveness to promptness.
Formal Methods in System Design 34(2),
pp. 83–103,
doi:10.1007/s10703-009-0067-z.
Andrzej Mostowski (1991):
Games with Forbidden Positions.
Technical Report 78.
University of Gdańsk.
Mickael Randour (2013):
Automated Synthesis of Reliable and Efficient Systems Through Game Theory: A Case Study.
In: Thomas Gilbert, Markus Kirkilionis & Gregoire Nicolis: ECCS 2012,
Springer Proceedings in Complexity.
Springer,
pp. 731–738,
doi:10.1007/978-3-319-00395-5_90.
F. Thuijsman & O.J. Vrieze (1987):
The bad match; A total reward stochastic game.
OR Spektrum 9(2),
pp. 93–99,
doi:10.1007/BF01732644.
Yaron Velner, Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Alexander Moshe Rabinovich & Jean-François Raskin (2015):
The complexity of multi-mean-payoff and multi-energy games.
Inf. Comput. 241,
pp. 177–196,
doi:10.1016/j.ic.2015.03.001.
Martin Zimmermann (2015):
Parameterized Linear Temporal Logics Meet Costs: Still not Costlier than LTL.
In: Javier Esparza & Enrico Tronci: GandALF 2015,
EPTCS 193.
Open Publishing Association,
pp. 144–157,
doi:10.4204/EPTCS.193.11.
Uri Zwick & Mike Paterson (1996):
The complexity of mean payoff games on graphs.
TCS 158(1-2),
pp. 343–359,
doi:10.1016/0304-3975(95)00188-3.
eptcs@eptcs.org