The complexity of mean payoff games on graphs
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
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
UPPAAL-Tiga: time for playing games!
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Timed alternating-time temporal logic
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
Model-checking timed ATL for durational concurrent game structures
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
A compositional framework for controller synthesis
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Measuring permissiveness in parity games: mean-payoff parity games revisited
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
| Hi-index | 0.00 |
In this paper, we extend the classical notion of strategies in turn-based finite games by allowing several moves to be selected. We define and study a quantitative measure for permissivity of such strategies by assigning penalties when blocking transitions. We prove that for reachability objectives, most permissive strategies exist, can be chosen memoryless, and can be computed in polynomial time, while it is in NP *** coNP for discounted and mean penalties.