Computer-aided verification of coordinating processes: the automata-theoretic approach
Computer-aided verification of coordinating processes: the automata-theoretic approach
What's decidable about hybrid automata?
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Model checking
Automatic predicate abstraction of C programs
Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Reachability Analysis via Face Lifting
HSCC '98 Proceedings of the First International Workshop on Hybrid Systems: Computation and Control
Series of Abstractions for Hybrid Automata
HSCC '02 Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
Reachability Analysis of Hybrid Systems via Predicate Abstraction
HSCC '02 Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
Counterexample-Guided Abstraction Refinement
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
SAT Based Abstraction-Refinement Using ILP and Machine Learning Techniques
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
Predicate abstraction for reachability analysis of hybrid systems
ACM Transactions on Embedded Computing Systems (TECS)
Counterexample-guided predicate abstraction of hybrid systems
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2003)
Safety verification of hybrid systems by constraint propagation-based abstraction refinement
ACM Transactions on Embedded Computing Systems (TECS)
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
A dynamic algorithm for approximate flow computations
Proceedings of the 14th international conference on Hybrid systems: computation and control
Electronic Notes in Theoretical Computer Science (ENTCS)
Formal verification of hybrid systems
EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
Object-oriented formal modeling and analysis of interacting hybrid systems in HI-maude
SEFM'11 Proceedings of the 9th international conference on Software engineering and formal methods
Model checking of hybrid systems: from reachability towards stability
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Safety verification for probabilistic hybrid systems
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Avoiding geometric intersection operations in reachability analysis of hybrid systems
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
Sciduction: combining induction, deduction, and structure for verification and synthesis
Proceedings of the 49th Annual Design Automation Conference
Verification of Safety and Liveness Properties of Metric Transition Systems
ACM Transactions on Embedded Computing Systems (TECS) - Special Section on CAPA'09, Special Section on WHS'09, and Special Section VCPSS' 09
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
HybridSAL relational abstracter
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Safety verification for linear systems
Proceedings of the Eleventh ACM International Conference on Embedded Software
A compositional modelling and analysis framework for stochastic hybrid systems
Formal Methods in System Design
Hi-index | 0.00 |
Hybrid dynamic systems include both continuous and discrete state variables. Properties of hybrid systems, which have an infinite state space, can often be verified using ordinary model checking together with a finite-state abstraction. Model checking can be inconclusive, however, in which case the abstraction must be refined. This paper presents a new procedure to perform this refinement operation for abstractions of infinite-state systems, in particular of hybrid systems. Following an approach originally developed for finite-state systems [1, 2], the refinement procedure constructs a new abstraction that eliminates a counterexample generated by the model checker. For hybrid systems, analysis of the counterexample requires the computation of sets of reachable states in the continuous state space.We showhowsuch reachability computations with varying degrees of complexity can be used to refine hybrid system abstractions efficiently. A detailed example illustrates our counterexample-guided refinement procedure. Experimental results for a prototype implementation of the procedure indicate its advantages over existing methods.