Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
The complexity of probabilistic verification
Journal of the ACM (JACM)
Infinite games on finitely coloured graphs with applications to automata on infinite trees
Theoretical Computer Science
Proceedings of the Conference on Logic of Programs
Automata logics, and infinite games: a guide to current research
Automata logics, and infinite games: a guide to current research
Quantitative stochastic parity games
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Model checking for a probabilistic branching time logic with fairness
Distributed Computing
CONCUR 2005 - Concurrency Theory
Temporal Logics and Model Checking for Fairly Correct Systems
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
Qualitative Determinacy and Decidability of Stochastic Games with Signals
LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Counterexamples in Probabilistic LTL Model Checking for Markov Chains
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Model checking almost all paths can be less expensive than checking all paths
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Defining Fairness in Reactive and Concurrent Systems
Journal of the ACM (JACM)
| Hi-index | 0.00 |
Two-player games are used to model open systems. One player models the system, trying to respect some specification, while the other player models the environment. In classical model checking, the objective is to verify that the system can respect its specification, whatever the environment does. In this article, we consider a more realistic scenario when the environment is supposed to be fair. We define a notion of fair player in two-player games. Our solution is inspired by Banach-Mazur games, and leads to a definition of a novel class of 3-player games called ABM-games. For ω-regular specifications on finite arenas, we explore the properties of ABM-games and devise an algorithm for solving them. As the main result, we show that winning in an ABM-game (i.e. winning against a fair player) is equivalent to winning with probability one against the randomized adversary.