Controller Synthesis for Parametric Timed Games
Formal Languages and Automata Theory
2025-06-19 v1
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.
Keywords
Cite
@article{arxiv.2506.15532,
title = {Controller Synthesis for Parametric Timed Games},
author = {Mikael Bisgaard Dahlsen-Jensen and Baptiste Fievet and Laure Petrucci and Jaco van de Pol},
journal= {arXiv preprint arXiv:2506.15532},
year = {2025}
}
Comments
This is the full version of the paper under the same title accepted to QEST+FORMATS 2025. 29 pages