Verification of hybrid systems based on counterexample-guided abstraction refinement
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Counter-example guided predicate abstraction of hybrid systems
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Verification and synthesis using real quantifier elimination
Proceedings of the 36th international symposium on Symbolic and algebraic computation
SpaceEx: scalable verification of hybrid systems
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Relational abstractions for continuous and hybrid systems
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Mining requirements from closed-loop control models
Proceedings of the 16th international conference on Hybrid systems: computation and control
Spatio-temporal hybrid automata for safe cyber-physical systems: a medical case study
Proceedings of the ACM/IEEE 4th International Conference on Cyber-Physical Systems
Safety verification for linear systems
Proceedings of the Eleventh ACM International Conference on Embedded Software
Time-aware relational abstractions for hybrid systems
Proceedings of the Eleventh ACM International Conference on Embedded Software
| Hi-index | 0.00 |
This paper describes the HybridSAL relational abstracter --- a tool for verifying continuous and hybrid dynamical systems. The input to the tool is a model of a hybrid dynamical system and a safety property. The output of the tool is a discrete state transition system and a safety property. The correctness guarantee provided by the tool is that if the output property holds for the output discrete system, then the input property holds for the input hybrid system. The input is in HybridSal input language and the output is in SAL syntax. The SAL model can be verified using the SAL tool suite. This paper describes the HybridSAL relational abstracter --- the algorithms it implements, its input, its strength and weaknesses, and its use for verification using the SAL infinite bounded model checker and k-induction prover.