Controller Synthesis for Parametric Timed Games
arXiv:2506.15532
Abstract
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.
This is the full version of the paper under the same title accepted to QEST+FORMATS 2025. 29 pages