A Zone-Based Algorithm for Timed Parity Games
By: Gilles Geeraerts , Frédéric Herbreteau , Jean-François Raskin and more
Potential Business Impact:
Makes computer games fairer and smarter.
This paper revisits timed games by building upon the semantics introduced in "The Element of Surprise in Timed Games". We introduce some modifications to this semantics for two primary reasons: firstly, we recognize instances where the original semantics appears counterintuitive in the context of controller synthesis; secondly, we present methods to develop efficient zone-based algorithms. Our algorithm successfully addresses timed parity games, and we have implemented it using UppAal's zone library. This prototype effectively demonstrates the feasibility of a zone-based algorithm for parity objectives and a rich semantics for timed interactions between the players.
Similar Papers
Controller Synthesis for Parametric Timed Games
Formal Languages and Automata Theory
Finds winning moves in complex games with changing rules.
Algorithm and Strategy Construction for Sure-Almost-Sure Stochastic Parity Games
CS and Game Theory
Finds winning moves in games with sure and likely goals.
A Timed Obstruction Logic for Dynamic Game Models
Logic in Computer Science
Protects computer systems from hackers.