Daniel Andersson (2006):
An improved algorithm for discounted payoff games.
In: Janneke Huitink & Sophia Katrenko: Proceedings of the 11th ESSLLI Student Session,
pp. 91–98.
Patricia Bouyer, Uli Fahrenberg, Kim Guldstrand Larsen & Nicolas Markey (2010):
Timed Automata with Observers under Energy Constraints.
In: Karl Henrik Johansson & Wang Yi: Proceedings of the 13th International Workshop on Hybrid Systems: Computation and Control (HSCC'10).
ACM Press,
pp. 61–70,
doi:10.1145/1755952.1755963.
Patricia Bouyer, Uli Fahrenberg, Kim Guldstrand Larsen, Nicolas Markey & JiříSrba (2008):
Infinite Runs in Weighted Timed Automata with Energy Constraints.
In: Franck Cassez & Claude Jard: Proceedings of the 6th International Conferences on Formal Modelling and Analysis of Timed Systems (FORMATS'08),
Lecture Notes in Computer Science 5215.
Springer-Verlag,
pp. 33–47,
doi:10.1007/978-3-540-85778-5_4.
Patricia Bouyer, Piotr Hofman, Nicolas Markey, Mickael Randour & Martin Zimmermann (2017):
Bounding Average-energy Games.
In: Javier Esparza & Andrzej Murawski: Proceedings of the 20th International Conference on Foundations of Software Science and Computation Structure (FoSSaCS'17),
Lecture Notes in Computer Science 10203.
Springer-Verlag,
pp. 179–195,
doi:10.1007/978-3-662-54458-7_11.
Patricia Bouyer, Kim Guldstrand Larsen & Nicolas Markey (2012):
Lower-Bound Constrained Runs in Weighted Timed Automata.
In: Proceedings of the 9th International Conference on Quantitative Evaluation of Systems (QEST'12).
IEEE Comp. Soc. Press,
pp. 128–137,
doi:10.1109/QEST.2012.28.
Patricia Bouyer, Nicolas Markey, Mickael Randour, Kim Guldstrand Larsen & Simon Laursen (2015):
Average-energy games.
In: Javier Esparza & Enrico Tronci: Proceedings of the 6th International Symposium on Games, Automata, Logics and Formal Verification (GandALF'15),
Electronic Proceedings in Theoretical Computer Science 193,
pp. 1–15,
doi:10.4204/EPTCS.193.1.
Franck Cassez, Jan J. Jensen, Kim Guldstrand 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: Proceedings of the 12th International Workshop on Hybrid Systems: Computation and Control (HSCC'09),
Lecture Notes in Computer Science 5469.
Springer-Verlag,
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: Proceedings of the 3rd International Conference on Embedded Software (EMSOFT'03),
Lecture Notes in Computer Science 2855.
Springer-Verlag,
pp. 117–133,
doi:10.1007/978-3-540-45212-6_9.
Krishnendu Chatterjee & Laurent Doyen (2012):
Energy Parity Games.
Theoretical Computer Science 458,
pp. 49–60,
doi:10.1016/j.tcs.2012.07.038.
Krishnendu Chatterjee, Laurent Doyen & Thomas A. Henzinger (2017):
The Cost of Exactness in Quantitative Reachability.
In: Luca Aceto, Giorgio Bacci, Giovanni Bacci, Anna Ingólfsdóttir, Axel Legay & Radu Mardare: Models, Algorithms, Logics and Tools: Essays Dedicated to Kim Guldstrand Larsen on the Occasion of His 60th Birthday,
Lecture Notes in Computer Science 10460.
Springer-Verlag,
pp. 367–381,
doi:10.1007/978-3-319-63121-9_18.
Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger & Jean-François Raskin (2010):
Generalized Mean-payoff and Energy Games.
In: Kamal Lodaya & Meena Mahajan: Proceedings of the 30th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'10),
Leibniz International Proceedings in Informatics 8.
Leibniz-Zentrum für Informatik,
pp. 505–516,
doi:10.4230/LIPIcs.FSTTCS.2010.505.
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.
Aldric Degorre, Laurent Doyen, Raffaella Gentilini, Jean-François Raskin & Szymon Toruńczyk (2010):
Energy and Mean-Payoff Games with Imperfect Information.
In: Anuj Dawar & Helmut Veith: Proceedings of the 24th International Workshop on Computer Science Logic (CSL'10),
Lecture Notes in Computer Science 6247.
Springer-Verlag,
pp. 260–274,
doi:10.1007/978-3-642-15205-4_22.
Dario Della Monica & Aniello Murano (2018):
Parity-energy ATL for Qualitative and Quantitative Reasoning in MAS.
In: Elisabeth André, Sven Koenig, Mehdi Dastani & Gita Sukthankar: Proceedings of the 17th International Conference on Autonomous Agents and Multiagent Systems (AAMAS'18).
International Foundation for Autonomous Agents and Multiagent Systems,
pp. 1441–1449.
Andrzej Ehrenfeucht & Jan Mycielski (1979):
Positional strategies for mean payoff games.
International Journal of Game Theory 8(2),
pp. 109–113,
doi:10.1007/BF01768705.
Daniel Ejsing-Dunn & Lisa Fontani (2013):
Infinite Runs in Recharge Automata.
Computer Science Department, Aalborg University, Denmark.
Uli Fahrenberg, Line Juhl, Kim Guldstrand Larsen & JiříSrba (2011):
Energy Games in Multiweighted Automata.
In: Antonio Cerone & Pekka Pihlajasaari: Proceedings of the 8th International Colloquium on Theoretical Aspects of Computing (ICTAC'11),
Lecture Notes in Computer Science 6916.
Springer-Verlag,
pp. 95–115,
doi:10.1007/978-3-642-23283-1_9.
John Fearnley & Marcin Jurdziński (2013):
Reachability in two-clock timed automata is PSPACE-complete.
In: Fedor V. Fomin, Rusins Freivalds, Marta Kwiatkowska & David Peleg: Proceedings of the 40th International Colloquium on Automata, Languages and Programming (ICALP'13) – Part II,
Lecture Notes in Computer Science 7966.
Springer-Verlag,
pp. 212–223,
doi:10.1007/978-3-642-39212-2_21.
Stefan Göller, Christoph Haase, Joël Ouaknine & James Worrell (2010):
Model Checking Succinct and Parametric One-Counter Automata.
In: Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide & Paul G. Spirakis: Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP'10) – Part II,
Lecture Notes in Computer Science 6199.
Springer-Verlag,
pp. 575–586,
doi:10.1007/978-3-642-14162-1_48.
Paul Hunter (2015):
Reachability in Succinct One-Counter Games.
In: Mikołaj Bojańczyk, Sławomir Lasota & Igor Potapov: Proceedings of the 9th Workshop on Reachability Problems in Computational Models (RP'15),
Lecture Notes in Computer Science 9328.
Springer-Verlag,
pp. 37–49,
doi:10.1007/978-3-319-24537-9_5.
Line Juhl, Kim Guldstrand Larsen & Jean-François Raskin (2013):
Optimal Bounds for Multiweighted and Parametrised Energy Games.
In: Zhiming Liu, Jim Woodcock & Yunshan Zhu: Theories of Programming and Formal Methods – Essays Dedicated to Jifeng He on the Occasion of His 70th Birthday,
Lecture Notes in Computer Science 8051.
Springer-Verlag,
pp. 244–255,
doi:10.1007/978-3-642-39698-4_15.
Marcin Jurdziński, François Laroussinie & Jeremy Sproston (2007):
Model Checking Probabilistic Timed Automata with One or Two Clocks.
In: Orna Grumberg & Michael Huth: Proceedings of the 13th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS'07),
Lecture Notes in Computer Science 4424.
Springer-Verlag,
pp. 170–184,
doi:10.1007/978-3-540-71209-1_15.
Marcin Jurdziński, Ranko Lazi\'c & Sylvain Schmitz (2015):
Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time.
In: Magnús M. Halldórsson, Kazuo Iwana, Naoki Kobayashi & Bettina Speckmann: Proceedings of the 42nd International Colloquium on Automata, Languages and Programming (ICALP'15) – Part II,
Lecture Notes in Computer Science 9135.
Springer-Verlag,
pp. 260–272,
doi:10.1007/978-3-662-47666-6_21.
Donald A. Martin (1975):
Borel Determinacy.
Annals of Mathematics 102(2),
pp. 363–371,
doi:10.2307/1971035.
Julien Reichert (2016):
On The Complexity of Counter Reachability Games.
Fundamenta Informaticae 143(3-4),
pp. 415–436,
doi:10.3233/FI-2016-1320.
Yaron Velner, Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Alexander Rabinovich & Jean-François Raskin (2015):
The complexity of multi-mean-payoff and multi-energy games.
Information and Computation 241,
pp. 177–196,
doi:10.1016/j.ic.2015.03.001.
Uri Zwick & Mike Paterson (1996):
The Complexity of Mean Payoff Games on Graphs.
Theoretical Computer Science 158(1-2),
pp. 343–359,
doi:10.1016/0304-3975(95)00188-3.