The question of the exact complexity of solving parity games is one of the major open problems in system verification, as it is equivalent to the problem of model-checking the mod...
Three-color parity games capture the disjunction of a B¨uchi and a co-B¨uchi condition. The most efficient known algorithm for these games is the progress measures algorithm by ...
This paper presents a new lower bound for the discrete strategy improvement algorithm for solving parity games due to V¨oge and Jurdzi´nski. First, we informally show which stru...
We consider two-player games played in real time on game structures with clocks and parity objectives. The games are concurrent in that at each turn, both players independently pro...
Krishnendu Chatterjee, Thomas A. Henzinger, Vinaya...
The synthesis of reactive systems requires the solution of two-player games on graphs with -regular objectives. When the objective is specified by a linear temporal logic formula o...