Measuring permissiveness in parity games: mean-payoff parity games revisited

Authors:
Patricia Bouyer;Nicolas Markey;Jörg Olschewski;Michael Ummels
Affiliations:
LSV, CNRS & ENS Cachan, France;LSV, CNRS & ENS Cachan, France;Lehrstuhl Informatik 7, RWTH Aachen University, Germany;LSV, CNRS & ENS Cachan, France and LAMSADE, CNRS & Université Paris-Dauphine, France
Venue:
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Year:
2011

Citing 12
Cited 4

Tree automata, Mu-Calculus and determinacy

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
The complexity of mean payoff games on graphs

Theoretical Computer Science
Infinite games on finitely coloured graphs with applications to automata on infinite trees

Theoretical Computer Science
Deciding the winner in parity games is in UP ∩ co-UP

Information Processing Letters
Infinite Games and Verification (Extended Abstract of a Tutorial)

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Mean-Payoff Parity Games

LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Infinite Runs in Weighted Timed Automata with Energy Constraints

FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Better Quality in Synthesis through Quantitative Objectives

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Measuring Permissivity in Finite Games

CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Generalized parity games

FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Energy parity games

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Half-Positional determinacy of infinite games

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II

Energy parity games

Theoretical Computer Science
Strategy synthesis for multi-dimensional quantitative objectives

CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Synthesis from LTL specifications with mean-payoff objectives

TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Quantitative timed simulation functions and refinement metrics for real-time systems

Proceedings of the 16th international conference on Hybrid systems: computation and control

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.