Timed Parity Games: Complexity and Robustness
Timed Parity Games: Complexity and Robustness
We consider two-player games played in real time on game structures with clocks where the objectives of players are described using parity conditions. The games are \emph{concurrent} in that at each turn, both players independently propose a time delay and an action, and the action with the shorter delay is …