2011
DOI: 10.1007/978-3-642-22110-1_30
|View full text |Cite
|
Sign up to set email alerts
|

SpaceEx: Scalable Verification of Hybrid Systems

Abstract: Abstract. We present a scalable reachability algorithm for hybrid systems with piecewise affine, non-deterministic dynamics. It combines polyhedra and support function representations of continuous sets to compute an over-approximation of the reachable states. The algorithm improves over previous work by using variable time steps to guarantee a given local error bound. In addition, we propose an improved approximation model, which drastically improves the accuracy of the algorithm. The algorithm is implemented… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

2
671
0
1

Year Published

2012
2012
2020
2020

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 707 publications
(707 citation statements)
references
References 14 publications
2
671
0
1
Order By: Relevance
“…Given the description of a hybrid system A, a safety property ϕ, and an abstract counter-example C as a sequence of modes/transitions, the falsification problem is reformulated as an optimization problem. The abstract counter-example C may be obtained by running the flowpipe construction tool such as SpaceEx [24], or alternatively by enumerating all likely mode/transition sequences up to a given length. Our implementation uses the latter combined with some user guidance to narrow the search space.…”
Section: A Implementationmentioning
confidence: 99%
See 2 more Smart Citations
“…Given the description of a hybrid system A, a safety property ϕ, and an abstract counter-example C as a sequence of modes/transitions, the falsification problem is reformulated as an optimization problem. The abstract counter-example C may be obtained by running the flowpipe construction tool such as SpaceEx [24], or alternatively by enumerating all likely mode/transition sequences up to a given length. Our implementation uses the latter combined with some user guidance to narrow the search space.…”
Section: A Implementationmentioning
confidence: 99%
“…Unfortunately, checking if a dynamical system (discrete, con- tinuous or hybrid) satisfies a safety property is undecidable for all but the simplest of cases. A number of verification tools for hybrid automata conservatively estimate the set of reachable behaviors (reach set estimation) for establishing safety properties of hybrid systems [4], [5], [12], [24], [30], [34], [36]. If the unsafe region is reachable, these techniques report a plausible abstract error trajectory.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…The popular over-approximate representations are convex polytopes [9], ellipsoids [18], zonotopes [14] and support functions [19]. Along with their computation techniques, the tools CheckMate [23], Ellipsoidal Toolbox, PHAVer [11] and SpaceEx [12] are developed. On the other hand, few reachable set representations other than intervals (boxes) [21] are successfully applied to non-linear hybrid systems.…”
Section: Introductionmentioning
confidence: 99%
“…Both methods are provided by a proprietary package from Maplesoft [5]. Our experiments target the SpaceEx tool, which is a tool for verifying safety properties of linear hybrid systems [4]. SpaceEx allows the designer to specify a hybrid system and a property to be verified, in the form of a temporal logic formula.…”
Section: Introductionmentioning
confidence: 99%