Symbolic Quantitative Robustness Analysis of Timed Automata
Résumé
We study the robust safety problem for timed automata under guard imprecisions which consists in computing an imprecision parameter under which a safety specification holds. We give a symbolic semi-algorithm for the problem based on a parametric data structure, and evaluate its performance in comparison with a recently published one, and with a binary search on enlargement values.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...