.png){kind=icon}
Return
Controller Synthesis for Parametric Timed Games
.png){kind=icon}
PRE
AI
DOI：10.1007/978-3-032-05792-1_17.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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:
parametric timed games
winning strategies
controller synthesis
timed automata
production cell
Journal
Q
IF:
0
Papers:
26
Citations:
0
Organization
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSave
View more