Name
Abstract | ||
|---|---|---|
Template polyhedra generalize intervals and octagons to polyhedra whose facets are orthogonal to a given set of arbitrary directions. They have been employed in the abstract interpretation of programs and, with particular success, in the reachability analysis of hybrid automata. While previously, the choice of directions has been left to the user or a heuristic, we present a method for the automatic discovery of directions that generalize and eliminate spurious counterexamples. We show that for the class of convex hybrid automata, i.e., hybrid automata with (possibly nonlinear) convex constraints on derivatives, such directions always exist and can be found using convex optimization. We embed our method inside a CEGAR loop, thus enabling the time-unbounded reachability analysis of an important and richer class of hybrid automata than was previously possible. We evaluate our method on several benchmarks, demonstrating also its superior efficiency for the special case of linear hybrid automata. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/978-3-662-54577-5_34 | TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, TACAS 2017, PT I |
Field | DocType | Volume |
Discrete mathematics,Heuristic,Computer science,Abstract interpretation,Polyhedron,Automaton,Regular polygon,Reachability,Counterexample,Convex optimization | Conference | 10205 |
ISSN | Citations | PageRank |
0302-9743 | 5 | 0.41 |
References | Authors | |
26 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sergiy Bogomolov | 1 | 115 | 13.97 |
| Goran Frehse | 2 | 745 | 38.95 |
| Mirco Giacobbe | 3 | 9 | 5.29 |
| Thomas A. Henzinger | 4 | 14827 | 1317.51 |