Design and evaluation tools for automated highway systems
Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Automatic analysis of hybrid systems
Automatic analysis of hybrid systems
Discrete-time control for rectangular hybrid automata
Theoretical Computer Science
Series of Abstractions for Hybrid Automata
HSCC '02 Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Counterexample-Guided Abstraction Refinement
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
High-Level Modeling and Analysis of TCAS
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
Reachability for linear hybrid automata using iterative relaxation abstraction
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Deciding bit-vector arithmetic with abstraction
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Approximate reachability for linear systems
HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
Behavioural approximations for restricted linear differential hybrid automata
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
The discrete time behavior of lazy linear hybrid automata
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
PHAVer: algorithmic verification of hybrid systems past hytech
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
Towards component based design of hybrid systems: safety and stability
Time for verification
Proceedings of the 14th international conference on Hybrid systems: computation and control
CalCS: SMT solving for non-linear convex constraints
Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
Synthesis of quantized feedback control software for discrete time linear hybrid systems
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Hi-index | 0.00 |
Lazy linear hybrid automata (LLHA) model the discrete time behavior of control systems containing finite-precision sensors and actuators interacting with their environment under bounded inertial delays. In this paper, we present a symbolic technique for reachability analysis of lazy linear hybrid automata. The model permits invariants and guards to be nonlinear predicates but requires flow values to be constants. Assuming finite precision, flows represented by uniform linear predicates can be reduced to those containing values from a finite set of constants. We present an abstraction hierarchy for LLHA. Our verification technique is based on bounded model checking and k-induction for reachability analysis at different levels of the abstraction hierarchy within an abstraction-refinement framework. The counterexamples obtained during BMC are used to construct refinements in each iteration. Our technique is practical and compares favorably with state-of-the-art tools, as demonstrated on examples that include the Air Traffic Alert and Collision Avoidance System (TCAS).