The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
Property preserving abstractions for the verification of concurrent systems
Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
Bounded Model Checking Using Satisfiability Solving
Formal Methods in System Design
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Bebop: A Symbolic Model Checker for Boolean Programs
Proceedings of the 7th International SPIN Workshop on SPIN Model Checking and Software Verification
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
Boolean and Cartesian Abstraction for Model Checking C Programs
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
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)
Hybrid Automata in Systems Biology: How Far Can We Go?
Electronic Notes in Theoretical Computer Science (ENTCS)
Model checking genetic regulatory networks with parameter uncertainty
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Hybrid automata, reachability, and Systems Biology
Theoretical Computer Science
Verification of continuous dynamical systems by timed automata
Formal Methods in System Design
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Algorithmic algebraic model checking i: challenges from systems biology
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Primal–dual tests for safety and reachability
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
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
Probabilistic Temporal Logic Falsification of Cyber-Physical Systems
ACM Transactions on Embedded Computing Systems (TECS) - Special Section on Probabilistic Embedded Computing
Realization theory of discrete-time linear switched systems
Automatica (Journal of IFAC)
Safety verification for linear systems
Proceedings of the Eleventh ACM International Conference on Embedded Software
| Hi-index | 0.00 |
Predicate abstraction has emerged to be a powerful technique for extracting finite-state models from infinite-state systems, and has been recently shown to enhance the effectiveness of the reachability computation techniques for hybrid systems. Given a hybrid system with linear dynamics and a set of linear predicates, the verifier performs an on-the-fly search of the finite discrete quotient whose states correspond to the truth assignments to the input predicates. To compute the transitions out of an abstract state, the tool needs to compute the set of discrete and continuous successors, and find out all the abstract states that this set intersects with. The complexity of this computation grows exponentially with the number of abstraction predicates. In this paper we present various optimizations that are aimed at speeding up the search in the abstract state-space, and demonstrate their benefits via case studies. We also discuss the completeness of the predicate abstraction technique for proving safety of hybrid systems.