Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited

We study nondeterministic strategies in parity games with the aim of computing a most permissive winning strategy. Following earlier work, we measure permissiveness in terms of the average number/ weight of transitions blocked by a strategy. Using a translation into mean-payoff parity games, we prove that deciding (the permissiveness of) a most permissive winning strategy is in NP ∩ coNP. Along the way, we provide a new study of mean-payoff parity games. In particular, we give a new algorithm for solving these games, which beats all previously known algorithms for this problem.

[1]  Richard M. Karp,et al.  A characterization of the minimum cycle mean in a digraph , 1978, Discret. Math..

[2]  A. Ehrenfeucht,et al.  Positional strategies for mean payoff games , 1979 .

[3]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

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

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

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

[7]  Marcin Jurdziński,et al.  Deciding the Winner in Parity Games is in UP \cap co-Up , 1998, Inf. Process. Lett..

[8]  Igor Walukiewicz,et al.  Permissive strategies: from parity games to safety games , 2002, RAIRO Theor. Informatics Appl..

[9]  Wolfgang Thomas,et al.  Infinite Games and Verification (Extended Abstract of a Tutorial) , 2002, CAV.

[10]  Thomas A. Henzinger,et al.  Resource Interfaces , 2003, EMSOFT.

[11]  Wieslaw Zielonka,et al.  Perfect-Information Stochastic Parity Games , 2004, FoSSaCS.

[12]  Hugo Gimbert,et al.  When Can You Play Positionally? , 2004, MFCS.

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

[14]  S. Pinchinat,et al.  You can always compute maximally permissive controllers under partial observation when they exist , 2005, Proceedings of the 2005, American Control Conference, 2005..

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

[16]  Hugo Gimbert,et al.  Perfect Information Stochastic Priority Games , 2007, ICALP.

[17]  Krishnendu Chatterjee,et al.  Generalized Parity Games , 2007, FoSSaCS.

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

[19]  Michael Luttenberger,et al.  Strategy Iteration using Non-Deterministic Strategies for Solving Parity Games , 2008, ArXiv.

[20]  Gabriel Renault,et al.  Measuring Permissivity in Finite Games , 2009, CONCUR.

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

[22]  Krishnendu Chatterjee,et al.  Energy Parity Games , 2010, ICALP.

[23]  Krishnendu Chatterjee,et al.  Generalized Mean-payoff and Energy Games , 2010, FSTTCS.