Language-based abstraction refinement for hybrid system verification

Authors:
Felix Klaedtke;Stefan Ratschan;Zhikun She
Affiliations:
ETH Zurich, Computer Science Department, Zurich, Switzerland;Institute of Computer Science, Czech Academy of Sciences, Prague, Czech Republic;Max-Planck-Institut für Informatik, Saarbrücken, Germany
Venue:
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Year:
2007

Citing 12
Cited 0

Constraint propagation with interval labels

Artificial Intelligence
What's decidable about hybrid automata?

Journal of Computer and System Sciences
Continuous First-Order Constraint Satisfaction

AISC '02/Calculemus '02 Proceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation
Counterexample-guided abstraction refinement for symbolic model checking

Journal of the ACM (JACM)
On the expressiveness and decidability of o-minimal hybrid systems

Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Predicate abstraction for reachability analysis of hybrid systems

ACM Transactions on Embedded Computing Systems (TECS)
Safety verification of hybrid systems by constraint propagation-based abstraction refinement

ACM Transactions on Embedded Computing Systems (TECS)
Reachability analysis of multi-affine systems

HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Automatic rectangular refinement of affine hybrid systems

FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Refining abstractions of hybrid systems using counterexample fragments

HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Safety verification of hybrid systems by constraint propagation based abstraction refinement

HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Constraints for continuous reachability in the verification of hybrid systems

AISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation

Quantified Score

Hi-index	0.01

Visualization

Abstract

The standard counterexample-guided abstraction-refinement (CEGAR) approach uses finite transition systems as abstractions of concrete systems. We present an approach to represent and refine abstractions of infinite-state systems that uses regular languages instead of finite transition systems. The advantage of using languages over transition systems is that we can store more fine-grained information in the abstraction and thus reduce the number of abstract states. Based on this language-based approach for cegar, we present new abstraction-refinement algorithms for hybrid system verification. Moreover, we evaluate our approach by verifying various non-linear hybrid systems.