Verification of linear hybrid systems with large discrete state spaces using counterexample-guided abstraction refinement

We present a counterexample-guided abstraction refinement ( CEGAR) approach for the verification of safety properties of linear hybrid automata with large discrete state spaces, such as naturally arising when incorporating health state monitoring and degradation levels into the controller design. Su...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Science of computer programming Ročník 148; s. 123 - 160
Hlavní autori: Althaus, Ernst, Beber, Björn, Damm, Werner, Disch, Stefan, Hagemann, Willem, Rakow, Astrid, Scholl, Christoph, Waldmann, Uwe, Wirtz, Boris
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier B.V 15.11.2017
Predmet:
CEGAR
Interpolation
Linear hybrid automata
Symbolic representation
Verification
Interpolation
Verification
Linear hybrid automata
CEGAR
Symbolic representation
ISSN:0167-6423, 1872-7964
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:We present a counterexample-guided abstraction refinement ( CEGAR) approach for the verification of safety properties of linear hybrid automata with large discrete state spaces, such as naturally arising when incorporating health state monitoring and degradation levels into the controller design. Such models can – in contrast to purely functional controller models – not be analyzed with hybrid verification engines relying on explicit representations of modes, but require fully symbolic representations for both the continuous and discrete part of the state space. The presented abstraction methods directly work on a symbolic representation of arbitrary non-convex combinations of linear constraints and boolean variables using LinAIGs. Several interpolation methods allow us to compute abstractions consisting of fewer linear constraints, and hence reduce the complexity of the reachable state set computation. In combination with methods that guarantee the preciseness of abstractions, this leads to a significant reduction of the runtimes of the verification process compared with exact verification. •We propose a counterexample guided abstraction refinement approach for linear hybrid systems.•The approach relies on abstraction algorithms replacing the original state set by state sets of simpler shape.•We provide benchmark results showing the relative merits of the approach.
ISSN:0167-6423
1872-7964
DOI:10.1016/j.scico.2017.04.010