Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: 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.

28
The categories of this paper are: alg-geom
12
The categories of this paper are: nucl-th
2
The categories of this paper are: math
14
The categories of this paper are: math-ph
29
The categories of this paper are: funct-an
22
The categories of this paper are: chao-dyn
23
The categories of this paper are: solv-int
27
The categories of this paper are: comp-gas
5
The categories of this paper are: gr-qc
8
The categories of this paper are: hep-ex
0
The categories of this paper are: hep-ph
31
The categories of this paper are: ao-sci
18
The categories of this paper are: econ
7
The categories of this paper are: hep-th
24
The categories of this paper are: dg-ga
21
The categories of this paper are: adap-org