On-The-Fly Algorithm for Reachability in Parametric Timed Games (Extended Version)
Abstract
Parametric Timed Games (PTG) are an extension of the model of Timed Automata. They allow for the verification and synthesis of real-time systems, reactive to their environmeand depending on adjustable parameters. Given a PTG and a reachability objective, we synthesize the values of the parameters such that the game is winning for the controller. We adapt and implement the On-The-Fly algorithm for parameter synthesis for PTG. Several pruning heuristics are introduced, to improve termination and speed of the algorithm. We evaluate the feasibility of parameter synthesis for PTG on two large case studies. Finally, we investigate the correctness guarantee of the algorithm: though the problem is undecidable, our semi-algorithm produces all correct parameter valuations ``in the limit''.
Keywords
Cite
@article{arxiv.2401.11287,
title = {On-The-Fly Algorithm for Reachability in Parametric Timed Games (Extended Version)},
author = {Mikael Bisgaard Dahlsen-Jensen and Baptiste Fievet and Laure Petrucci and Jaco van de Pol},
journal= {arXiv preprint arXiv:2401.11287},
year = {2024}
}
Comments
26 pages, 4 figures