Verification of hybrid systems based on counterexample-guided abstraction refinement

DOI10.1007/3-540-36577-X_14MaRDI QIDQ4417923zbMATH OpenFDO

Authors Ansgar Fehnker, Zhi Han, Olaf Stursberg, Michael Theobald, Edmund Clarke, Bruce H. Krogh

Publication date 30 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2619/26190192.htm

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Abstraction and Counterexample-Guided Refinement in Model Checking of Hybrid Systems
• Counterexample-guided predicate abstraction of hybrid systems
• Abstractions of hybrid systems for verification
• Refining abstractions of hybrid systems using counterexample fragments
• Counter-example guided predicate abstraction of hybrid systems
• Language-Based Abstraction Refinement for Hybrid System Verification
• Safety verification of hybrid systems by constraint propagation based abstraction refinement
• A compositional approach to the verification of hybrid systems
• Interface verification: Discrete abstractions of hybrid systems

Cited in

(27)

• Safe \& robust reachability analysis of hybrid systems
• Extracting counterexamples induced by safety violation in linear hybrid systems
• A compositional modelling and analysis framework for stochastic hybrid systems
• Hybridization based CEGAR for hybrid automata with affine dynamics
• Efficient dynamic error reduction for hybrid systems reachability analysis
• Syntax and consistent equation semantics of hybrid Chi
• Counterexample-guided predicate abstraction of hybrid systems
• Abstractions for hybrid systems
• Supervisory control of hybrid systems based on model abstraction and guided search
• Abstract interpretation with infinitesimals. Towards scalability in nonstandard static analysis
• Formal modelling, analysis and verification of hybrid systems
• Automatic Verification of Hybrid Systems with Large Discrete State Space
• Safety verification for probabilistic hybrid systems
• Counter-example guided predicate abstraction of hybrid systems
• Abstractions of hybrid systems for verification
• Abstractions Refinement for Hybrid Systems Diagnosability Analysis
• Constraints for Continuous Reachability in the Verification of Hybrid Systems
• Abstraction and Counterexample-Guided Construction of ω-Automata for Model Checking of Step-Discrete Linear Hybrid Models
• Language-Based Abstraction Refinement for Hybrid System Verification
• Formal Methods in Computer-Aided Design
• Abstraction and Counterexample-Guided Refinement in Model Checking of Hybrid Systems
• Refining abstractions of hybrid systems using counterexample fragments
• Safety verification of hybrid systems by constraint propagation based abstraction refinement
• Machine learning and logic: a new frontier in artificial intelligence
• Formal controller synthesis for Markov jump linear systems with uncertain dynamics
• Hybrid automata-based CEGAR for rectangular hybrid systems
• Semi-formal verification of the steady state behavior of mixed-signal circuits by SAT-based property checking

This page was built for publication: Verification of hybrid systems based on counterexample-guided abstraction refinement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4417923)