Lyapunov abstractions for inevitability of hybrid systems
From MaRDI portal
Publication:2986758
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30) Lyapunov and storage functions (93D30) Hybrid systems of ordinary differential equations (34A38)
Recommendations
- Dynamically-driven timed automaton abstractions for proving liveness of continuous systems
- Non-convex invariants and urgency conditions on linear hybrid automata
- The algorithmic analysis of hybrid systems
- Direct formal verification of liveness properties in continuous and hybrid dynamical systems
- Lyapunov-barrier characterization of robust reach-avoid-stay specifications for hybrid systems
Cited in
(10)- Hybrid tools for hybrid systems -- proving stability and safety at once
- Extracting counterexamples induced by safety violation in linear hybrid systems
- Lyapunov-barrier characterization of robust reach-avoid-stay specifications for hybrid systems
- An axiomatic approach to existence and liveness for differential equations
- Stability analysis of planar probabilistic piecewise constant derivative systems
- Verifying safety and persistence in hybrid systems using flowpipes and continuous invariants
- Non-convex invariants and urgency conditions on linear hybrid automata
- Foundations of Quantitative Predicate Abstraction for Stability Analysis of Hybrid Systems
- Deadness and how to disprove liveness in hybrid dynamical systems
- Dynamically-driven timed automaton abstractions for proving liveness of continuous systems
This page was built for publication: Lyapunov abstractions for inevitability of hybrid systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986758)
