# Robust Safety of Timed Automata

Abstract : Timed automata are governed by an idealized semantics that assumes a perfectly precise behavior of the clocks. The traditional semantics is not robust because the slightest perturbation in the timing of actions may lead to completely different behaviors of the automaton. Following several recent works, we consider a relaxation of this semantics, in which guards on transitions are widened by~$$Δ>0$$ and clocks can drift by~$$\epsilon>0$$. The relaxed semantics encompasses the imprecisions that are inevitably present in an implementation of a timed automaton, due to the finite precision of digital clocks.\par We solve the safety verification problem for this robust semantics: given a timed automaton and a set of bad states, our algorithm decides if there exist positive values for the parameters~$$Δ$$ and~$$\epsilon$$ such that the timed automaton never enters the bad states under the relaxed semantics.
Document type :
Journal articles

Cited literature [31 references]

https://hal.archives-ouvertes.fr/hal-01194592
Contributor : Nicolas Markey Connect in order to contact the contributor
Submitted on : Monday, September 7, 2015 - 12:02:13 PM
Last modification on : Friday, October 22, 2021 - 4:42:15 AM
Long-term archiving on: : Tuesday, December 8, 2015 - 10:57:00 AM

### File

DDMR-fmsd08.pdf
Files produced by the author(s)

### Citation

Martin De~wulf, Laurent Doyen, Nicolas Markey, Jean-François Raskin. Robust Safety of Timed Automata. Formal Methods in System Design, Springer Verlag, 2008, 33 (1-3), pp.45-84. ⟨10.1007/s10703-008-0056-7⟩. ⟨hal-01194592⟩

### Metrics

Les métriques sont temporairement indisponibles