B. Aminof & S. Rubin (2014):
First Cycle Games.
In: Proc. of SR,
EPTCS 146,
pp. 83–90,
doi:10.4204/EPTCS.146.11.
H. Björklund, S. Sandberg & S. Vorobyov (2004):
Memoryless Determinacy of Parity and Mean Payoff Games: A Simple Proof.
Theoretical Computer Science 310(1-3),
pp. 365–378,
doi:10.1016/S0304-3975(03)00427-4.
R. Bloem, K. Chatterjee, T.A. Henzinger & B. Jobstmann (2009):
Better Quality in Synthesis through Quantitative Objectives.
In: Proc. of CAV,
LNCS 5643.
Springer,
pp. 140–156,
doi:10.1007/978-3-642-02658-4_14.
E. Boros, K. Elbassioni, V. Gurvich & K. Makino (2015):
Markov Decision Processes and Stochastic Games with Total Effective Payoff.
In: Proc. of STACS,
LIPIcs 30.
Schloss Dagstuhl - LZI,
pp. 103–115,
doi:10.4230/LIPIcs.STACS.2015.103.
P. Bouyer, U. Fahrenberg, K.G. Larsen, N. Markey & J. Srba (2008):
Infinite Runs in Weighted Timed Automata with Energy Constraints.
In: Proc. of FORMATS,
LNCS 5215.
Springer,
pp. 33–47,
doi:10.1007/978-3-540-85778-5_4.
P. Bouyer, N. Markey, M. Randour, Larsen K.G. & S. Laursen (2015):
Average-energy games.
Research Report.
Laboratoire Spécification et Vérification, ENS Cachan, France.
Available at http://www.lsv.ens-cachan.fr/~randour/papers/BMRLL15.pdf.
T. Brázdil, D. Klaška, A. Kučera & P. Novotný (2014):
Minimizing Running Costs in Consumption Systems.
In: Proc. of CAV,
LNCS 8559.
Springer,
pp. 457–472,
doi:10.1007/978-3-319-08867-9_30.
L. Brim, J. Chaloupka, L. Doyen, R. Gentilini & J.-F. 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.
F. Cassez, J.J. Jessen, K.G. Larsen, J.-F. Raskin & P.-A. Reynier (2009):
Automatic Synthesis of Robust and Optimal Controllers – An Industrial Case Study.
In: Proc. of HSCC,
LNCS 5469.
Springer,
pp. 90–104,
doi:10.1007/978-3-642-00602-9_7.
A. Chakrabarti, L. de Alfaro, T.A. Henzinger & M. Stoelinga (2003):
Resource Interfaces.
In: Proc. of EMSOFT,
LNCS 2855.
Springer,
pp. 117–133,
doi:10.1007/978-3-540-45212-6_9.
K. Chatterjee & L. Doyen (2010):
Energy Parity Games.
In: Proc. of ICALP,
LNCS 6199.
Springer,
pp. 599–610,
doi:10.1007/978-3-642-14162-1_50.
K. Chatterjee, L. Doyen, M. Randour & J.-F. Raskin (2015):
Looking at mean-payoff and total-payoff through windows.
Information and Computation 242,
pp. 25 – 52,
doi:10.1016/j.ic.2015.03.010.
K. Chatterjee & V.S. Prabhu (2013):
Quantitative timed simulation functions and refinement metrics for real-time systems.
In: Proc. of HSCC.
ACM,
pp. 273–282,
doi:10.1145/2461328.2461370.
K. Chatterjee, M. Randour & J.-F. Raskin (2014):
Strategy synthesis for multi-dimensional quantitative objectives.
Acta Informatica 51(3-4),
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(2),
pp. 109–113,
doi:10.1007/BF01768705.
J. Fearnley & M. Jurdziński (2013):
Reachability in two-clock timed automata is PSPACE-complete.
In: Proc. of ICALP,
LNCS 7966.
Springer,
pp. 212–223,
doi:10.1007/978-3-642-39212-2_21.
J. Filar & K. Vrieze (1997):
Competitive Markov decision processes.
Springer.
M.R. Garey & D.S. Johnson (1979):
Computers and intractability: a guide to the Theory of NP-Completeness.
Freeman New York.
T. Gawlitza & H. Seidl (2009):
Games through Nested Fixpoints.
In: Proc. of CAV,
LNCS 5643.
Springer,
pp. 291–305,
doi:10.1007/978-3-642-02658-4_24.
H. Gimbert & W. Zielonka (2004):
When Can You Play Positionnaly?.
In: Proc. of MFCS,
LNCS 3153.
Springer,
pp. 686–697,
doi:10.1007/978-3-540-28629-5_53.
H. Gimbert & W. Zielonka (2005):
Games Where You Can Play Optimally Without Any Memory.
In: Proc. of CONCUR,
LNCS 3653.
Springer,
pp. 428–442,
doi:10.1007/11539452_33.
E. Grädel, W. Thomas & T. Wilke (2002):
Automata, Logics, and Infinite Games: A Guide to Current Research.
LNCS 2500.
Springer,
doi:10.1007/3-540-36387-4.
L. Juhl, K.G. Larsen & J.-F. Raskin (2013):
Optimal Bounds for Multiweighted and Parametrised Energy Games.
In: Theories of Programming and Formal Methods,
LNCS 8051.
Springer,
pp. 244–255,
doi:10.1007/978-3-642-39698-4_15.
M. Jurdziński (1998):
Deciding the Winner in Parity Games is in UPLaTeX Error: Bad math environment delimiterSee the LaTeX manual or LaTeX Companion for explanation.Your command was ignored.Type I <command> <return> to replace it with another command,or <return> to continue without it.co-UP.
Information Processing Letters 68(3),
pp. 119–124,
doi:10.1016/S0020-0190(98)00150-1.
M. Jurdziński, J. Sproston & F. Laroussinie (2008):
Model Checking Probabilistic Timed Automata with One or Two Clocks.
Logical Methods in Computer Science 4(3),
doi:10.2168/LMCS-4(3:12)2008.
R.M. Karp (1978):
A characterization of the minimum cycle mean in a digraph.
Discrete Mathematics 23(3),
doi:10.1016/0012-365X(78)90011-0.
E. Kopczynski (2006):
Half-Positional Determinacy of Infinite Games.
In: Proc. of ICALP,
LNCS 4052.
Springer,
pp. 336–347,
doi:10.1007/11787006_29.
P. Lafourcade, D. Lugiez & R. Treinen (2005):
Intruder Deduction for AC-Like Equational Theories with Homomorphisms.
In: Proc. of RTA,
LNCS 3467.
Springer,
pp. 308–322,
doi:10.1007/978-3-540-32033-3_23.
M. Randour (2013):
Automated Synthesis of Reliable and Efficient Systems Through Game Theory: A Case Study.
In: Proceedings of the European Conference on Complex Systems 2012,
Springer Proceedings in Complexity XVII.
Springer,
pp. 731–738,
doi:10.1007/978-3-319-00395-5_90.
M. Randour (2014):
Synthesis in Multi-Criteria Quantitative Games.
University of Mons, Belgium.
F. Thuijsman & O.J. Vrieze (1987):
The bad match; A total reward stochastic game.
OR Spektrum 9(2),
doi:10.1007/BF01732644.
Y. Velner, K. Chatterjee, L. Doyen, T.A. Henzinger, A.M. Rabinovich & J.-F. 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.
U. Zwick & M. 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.
eptcs@eptcs.org