Lazy abstractions for timed automata - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Lazy abstractions for timed automata


We consider the reachability problem for timed automata. A standard solution to this problem involves computing a search tree whose nodes are abstractions of zones. For efficiency reasons, they are parametrized by the maximal lower and upper bounds (LU-bounds) occurring in the guards of the automaton. We propose an algorithm that is updating LU-bounds during exploration of the search tree. In order to keep them as small as possible, the bounds are refined only when they enable a transition that is impossible in the unabstracted system. So our algorithm can be seen as a kind of lazy CEGAR algorithm for timed automata. We show that on several standard benchmarks, the algorithm is capable of keeping very small LU-bounds, and in consequence reduce the search space substantially.
Fichier principal
Vignette du fichier
m.pdf (959.75 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00775924 , version 1 (14-01-2013)
hal-00775924 , version 2 (17-01-2013)



Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz. Lazy abstractions for timed automata. CAV - 24th International Conference on Computer Aided Verification - 2013, Jul 2013, Saint Petersburg, Russia. ⟨hal-00775924v2⟩


86 View
393 Download



Gmail Facebook X LinkedIn More