Energy parity games☆

Energy parity games are infinite two-player turn-based games played on weighted graphs. The objective of the game combines a (qualitative) parity condition with the (quantitative) requirement that the sum of the weights (i.e., the level of energy in the game) must remain positive. Beside their own interest in the design and synthesis of resource-constrained omega-regular specifications, energy parity games provide one of the simplest model of games with combined qualitative and quantitative objectives. Our main results are as follows: (a) exponential memory is sufficient and may be necessary for winning strategies in energy parity games; (b) the problem of deciding the winner in energy parity games can be solved in NP ∩ coNP; and (c) we give an algorithm to solve energy parity by reduction to energy games. We also show that the problem of deciding the winner in energy parity games is logspace-equivalent to the problem of deciding the winner in mean-payoff parity games, which can thus be solved in NP ∩ coNP. As a consequence we also obtain a conceptually simple algorithm to solve mean-payoff parity games.

[1]  Olivier Serre,et al.  Parity Games Played on Transition Graphs of One-Counter Processes , 2006, FoSSaCS.

[2]  Eryk Kopczynski,et al.  Half-Positional Determinacy of Infinite Games , 2006, ICALP.

[3]  E. Allen Emerson,et al.  Tree automata, mu-calculus and determinacy , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[4]  A. Prasad Sistla,et al.  On Model-Checking for Fragments of µ-Calculus , 1993, CAV.

[5]  Peter Lammich,et al.  Tree Automata , 2009, Arch. Formal Proofs.

[6]  Hugo Gimbert,et al.  Games Where You Can Play Optimally Without Any Memory , 2005, CONCUR.

[7]  J. R. Büchi,et al.  Solving sequential conditions by finite-state strategies , 1969 .

[8]  Wieslaw Zielonka,et al.  Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees , 1998, Theor. Comput. Sci..

[9]  Martín Abadi,et al.  Realizable and Unrealizable Specifications of Reactive Systems , 1989, ICALP.

[10]  Henrik Björklund,et al.  Memoryless determinacy of parity and mean payoff games: a simple proof , 2004, Theor. Comput. Sci..

[11]  L. Shapley,et al.  Stochastic Games* , 1953, Proceedings of the National Academy of Sciences.

[12]  Jakub Chaloupka,et al.  Faster Algorithm for Mean-Payoff Games , 2009, MEMICS.

[13]  Kim G. Larsen,et al.  Infinite Runs in Weighted Timed Automata with Energy Constraints , 2008, FORMATS.

[14]  Yuri Gurevich,et al.  Trees, automata, and games , 1982, STOC '82.

[15]  Uri Zwick,et al.  The Complexity of Mean Payoff Games on Graphs , 1996, Theor. Comput. Sci..

[16]  Thomas Wilke,et al.  Automata logics, and infinite games: a guide to current research , 2002 .

[17]  Wolfgang Thomas,et al.  Languages, Automata, and Logic , 1997, Handbook of Formal Languages.

[18]  Amir Pnueli,et al.  On the synthesis of a reactive module , 1989, POPL '89.

[19]  P. Ramadge,et al.  Supervisory control of a class of discrete event processes , 1987 .

[20]  Patricia Bouyer,et al.  Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited , 2011, ATVA.

[21]  Krishnendu Chatterjee,et al.  Better Quality in Synthesis through Quantitative Objectives , 2009, CAV.

[22]  Krishnendu Chatterjee,et al.  Mean-payoff parity games , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[23]  Anne Condon,et al.  The Complexity of Stochastic Games , 1992, Inf. Comput..

[24]  Robert McNaughton,et al.  Infinite Games Played on Finite Graphs , 1993, Ann. Pure Appl. Logic.

[25]  L. Brim,et al.  Faster algorithms for mean-payoff games , 2011, Formal Methods Syst. Des..