Linear controller design: limits of performance
Linear controller design: limits of performance
Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
What's decidable about hybrid automata?
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Introduction to Hybrid Dynamical Systems
Introduction to Hybrid Dynamical Systems
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Termination proofs for systems code
Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
The Theory of Timed I/O Automata (Synthesis Lectures in Computer Science)
The Theory of Timed I/O Automata (Synthesis Lectures in Computer Science)
A verification framework for hybrid systems
A verification framework for hybrid systems
Approximating Continuous Systems by Timed Automata
FMSB '08 Proceedings of the 1st international workshop on Formal Methods in Systems Biology
Verifying average dwell time of hybrid systems
ACM Transactions on Embedded Computing Systems (TECS)
ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
Composing reachability analyses of hybrid systems for safety and stability
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
A step towards verification and synthesis from simulink/stateflow models
Proceedings of the 14th international conference on Hybrid systems: computation and control
Abstraction Refinement for Stability
ICCPS '11 Proceedings of the 2011 IEEE/ACM Second International Conference on Cyber-Physical Systems
Relational abstractions for continuous and hybrid systems
CAV'11 Proceedings of the 23rd international conference on Computer aided verification
On the stability of zeno equilibria
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Model checking of hybrid systems: from reachability towards stability
HSCC'06 Proceedings of the 9th 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
Dynamically-Driven timed automaton abstractions for proving liveness of continuous systems
FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
On the decidability of stability of hybrid systems
Proceedings of the 16th international conference on Hybrid systems: computation and control
Stabhyli: a tool for automatic stability verification of non-linear hybrid systems
Proceedings of the 16th international conference on Hybrid systems: computation and control
Abstraction based model-checking of stability of hybrid systems
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Safety verification for linear systems
Proceedings of the Eleventh ACM International Conference on Embedded Software
| Hi-index | 0.00 |
A set of states S is said to be inevitable for a hybrid automaton A if every behavior of A ultimately reaches S within bounded time. Inevitability captures various commonly occurring liveness properties. In this paper, we present an algorithm for verifying inevitability of Linear Hybrid Automata (LHA). The algorithm combines (a) Lyapunov function-based relational abstractions for the continuous dynamics with (b) automated construction of well-founded relations for the loops of the hybrid automaton. The algorithm is complete for automata that are symmetric with respect to the chosen Lyapunov functions. The algorithm is implemented in a prototype tool (LySHA) which is integrated with a Simulink/Stateflow frontend for modeling hybrid systems. The experimental results demonstrate the effectiveness of the methodology in verifying inevitability of hybrid automata with up to five continuous dimensions and forty locations.