SIAM Journal on Control and Optimization
A Decompositional Proof Scheme for Automated Convergence Proofs of Stochastic Hybrid Systems
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Towards component based design of hybrid systems: safety and stability
Time for verification
Proving stabilization of biological systems
VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
Algebraic analysis on asymptotic stability of switched hybrid systems
Proceedings of the 15th ACM 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
Hierarchical reasoning and model generation for the verification of parametric hybrid systems
CADE'13 Proceedings of the 24th international conference on Automated Deduction
| Hi-index | 0.00 |
In this paper, we present an automatable decompositional method for the computation of Lyapunov functions for hybrid systems with complex discrete state spaces. We use graph-based reasoning to decompose hybrid automata into subgraphs, for which we then solve semidefinite optimization problems to obtain local Lyapunov functions. These local computations are made in a way that ensures that the family of local Lyapunov functions forms a global Lyapunov function, proving asymptotic stability of the system. The main advantages over standard LMI methods are 1) improved numerical stability due to smaller optimization problems, 2) the possibility of incremental construction of stable hybrid automata and 3) easier diagnosis of unstable parts of the automaton in case no Lyapunov function can be found.