Composing Stability Proofs for Hybrid Systems

DOI10.1007/978-3-642-24310-3_20zbMATH Open1348.68107OpenAlexW197679583MaRDI QIDQ3172858FDOQ3172858

Corina Mitrohin, Andreas Podelski

Publication date: 7 October 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-24310-3_20

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Attainable sets, reachability (93B03) Stability of control systems (93D99)

Cites Work

• Hybrid Systems: Computation and Control
• A theory of timed automata
• Hybrid Systems: Computation and Control
• Composing Reachability Analyses of Hybrid Systems for Safety and Stability
• Region Stability Proofs for Hybrid Systems

Cited In (5)

• Verifying safety and persistence in hybrid systems using flowpipes and continuous invariants
• Towards Component Based Design of Hybrid Systems: Safety and Stability
• Deadness and how to disprove liveness in hybrid dynamical systems
• A complete-order hybrid identifier for multiprogrammed stabilization
• Foundations of Quantitative Predicate Abstraction for Stability Analysis of Hybrid Systems

Uses Software

• PHAVer
• HyTech

This page was built for publication: Composing Stability Proofs for Hybrid Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172858)