Non-convex invariants and urgency conditions on linear hybrid automata

DOI10.1007/978-3-319-10512-3_13MaRDI QIDQ5500563zbMATH OpenOpenAlexFDO

Authors Stefano Minopoli, Goran Frehse

Publication date 6 August 2015

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

Full work available at URL https://doi.org/10.1007/978-3-319-10512-3_13

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• The algorithmic analysis of hybrid systems
• Path-oriented reachability verification of a class of nonlinear hybrid automata using convex programming
• Symbolic Reachability Analysis of Lazy Linear Hybrid Automata
• Decidability and complexity for the verification of safety properties of reasonable linear hybrid automata
• Lyapunov abstractions for inevitability of hybrid systems

Cited in

(2)

• Lyapunov abstractions for inevitability of hybrid systems
• From simulation models to hybrid automata using urgency and relaxation

Describes a project that uses

Uses Software

• SpaceEx
• Ptolemy
• Uppaal
• Modelica
• Simulink
• HyTech
• PHAVer
• Matlab

This page was built for publication: Non-convex invariants and urgency conditions on linear hybrid automata

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