Symbolic Robustness Analysis of Timed Automata
We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the correctness of the model in presence of small drifts on the clocks or imprecision in testing guards. This problem is known to be decidable with an algorithm based on detecting strongly connected components on the region graph, which, for complexity reasons, is not effective in practice.
Our symbolic algorithm is based on the standard algorithm for symbolic reachability analysis using zones to represent symbolic states and can then be easily integrated within tools for the verification of timed automata models. It relies on the computation of the stable zone of each cycle in a timed automaton. The stable zone is the largest set of states that can reach and be reached from itself through the cycle. To compute the robust reachable set, each stable zone that intersects the set of explored states has to be added to the set of states to be explored.
KeywordsReachable State Stable Zone Symbolic State Region Graph Unsafe State
Unable to display preview. Download preview PDF.
- 1.Altisen, K., Tripakis, S.: Implementation of timed automata: an issue of semantics or modeling? Technical report, Verimag, Centre Équation, 38610 Gières (June 2005)Google Scholar
- 5.Daws, C.: Vérification de systèmes temporisés: de la théorie à la pratique. PhD thesis, Institut National Polytechnique de Grenoble (October 20, 1998)Google Scholar
- 8.De Wulf, M., Doyen, L., Raskin, J.: Almost ASAP Semantics: from timed models to timed implementations (2004)Google Scholar