Controller Synthesis for Parametric Timed Games
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866909652564836352 |
|---|---|
| author | Dahlsen-Jensen, Mikael Bisgaard Fievet, Baptiste Petrucci, Laure van de Pol, Jaco |
| author_facet | Dahlsen-Jensen, Mikael Bisgaard Fievet, Baptiste Petrucci, Laure van de Pol, Jaco |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_15532 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Controller Synthesis for Parametric Timed Games Dahlsen-Jensen, Mikael Bisgaard Fievet, Baptiste Petrucci, Laure van de Pol, Jaco Formal Languages and Automata Theory 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. |
| title | Controller Synthesis for Parametric Timed Games |
| topic | Formal Languages and Automata Theory |
| url | https://arxiv.org/abs/2506.15532 |