Lyapunov abstractions for inevitability of hybrid systems
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
Synthesis of minimal-error control software
Proceedings of the tenth ACM international conference on Embedded software
Limited-information control of hybrid systems via reachable set propagation
Proceedings of the 16th international conference on Hybrid systems: computation and control
On the decidability of stability of hybrid systems
Proceedings of the 16th international conference on Hybrid systems: computation and control
Safety verification for linear systems
Proceedings of the Eleventh ACM International Conference on Embedded Software
| Hi-index | 0.00 |
The paper presents a CEGAR-based procedure for verifying stability (region stabillity) of CPS modeled as hybrid automata. It relies a characterization of the blocking property of hybrid automata in terms of well-foundedness of a relation that combines the discrete transitions and continuous trajectories and a key assumption about the switching speed of the system in terms of average dwell time, but does not require the individual modes to be stable. This characterization enables the adaptation of program analysis techniques in the domain of hybrid systems. It is shown that the procedure is complete for rectangular initialized hybrid automata. Several illustrative examples are verified using a prototype tool that implements the methodology.