Quantitative Robustness Analysis of Flat Timed Automata

Remi Jaubert (1) , Pierre-Alain Reynier (1)

1 LIF - Laboratoire d'informatique Fondamentale de Marseille - UMR 6166

Whereas formal verification of timed systems has become a very active field of research, the idealized mathematical semantics of timed automata cannot be faithfully implemented. Recently, several works have studied a parametric semantics of timed automata related to implementability: if the specification is met for some positive value of the parameter, then there exists a correct implementation. In addition, the value of the parameter gives lower bounds on sufficient resources for the implementation. In this work, we present a symbolic algorithm for the computation of the parametric reachability set under this semantics for flat timed automata. As a consequence, we can compute the largest value of the parameter for a timed automaton to be safe.

Mots clés: reachability; robustness; Timed Automata; symbolic algorithm

Domaines: Modélisation et simulation

Remi Jaubert, Pierre-Alain Reynier. Quantitative Robustness Analysis of Flat Timed Automata. 2010. ⟨hal-00534896⟩