Controller Synthesis for Parametric Timed Games
By: Mikael Bisgaard Dahlsen-Jensen , Baptiste Fievet , Laure Petrucci and more
Potential Business Impact:
Finds winning moves in complex games with changing rules.
We present a (semi)-algorithm to compute winning strategies for parametric timed games. Previous algorithms only synthesized constraints on the clock parameters for which the game is winning. A new definition of (winning) strategies is proposed, and ways to compute them. A transformation of these strategies to (parametric) timed automata allows for building a controller enforcing them. The feasibility of the method is demonstrated by an implementation and experiments for the Production Cell case study.
Similar Papers
One-clock synthesis problems
Formal Languages and Automata Theory
Makes computers unable to guarantee winning games.
A Zone-Based Algorithm for Timed Parity Games
Logic in Computer Science
Makes computer games fairer and smarter.
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.