HYTECH: The Cornell HYbrid TECHnology Tool
Hybrid Systems II
Reachability Analysis of Hybrid Systems via Predicate Abstraction
HSCC '02 Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
Efficient Büchi Automata from LTL Formulae
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
VIS: A System for Verification and Synthesis
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
The d/dt Tool for Verification of Hybrid Systems
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
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
PHAVer: algorithmic verification of hybrid systems past hytech
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
A Counterexample-Guided Approach to Parameter Synthesis for Linear Hybrid Automata
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Refinement of Trace Abstraction
SAS '09 Proceedings of the 16th International Symposium on Static Analysis
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Automatic abstraction refinement for timed automata
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Automating verification of cooperation, control, and design in traffic applications
Formal methods and hybrid real-time systems
A dynamic algorithm for approximate flow computations
Proceedings of the 14th international conference on Hybrid systems: computation and control
Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces
Science of Computer Programming
Software model checking for people who love automata
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Safety verification for linear systems
Proceedings of the Eleventh ACM International Conference on Embedded Software
| Hi-index | 0.00 |
For the verification of reactive hybrid systems existing approaches do not scale well w.r.t. large discrete state spaces, since their excellence mostly applies to data computations. However, especially control dominated models of industrial relevance in which computations on continuous data are comprised only of subsidiary parts of the behavior, these large discrete state spaces are not uncommon. By exploiting typical characteristics of such models, the herein presented approach addresses step-discrete linear hybrid models with large discrete state spaces by introducing an iterative abstraction refinement approach based on learning reasons of spurious counterexamples in an ω-automaton. Due to the resulting exclusion of comprehensive classes of spurious counterexamples, the algorithm exhibits relatively few iterations to prove or disprove safety properties. The implemented algorithm was successfully applied to parts of industrial models and shows promising results.