Efficient verification of a class of linear hybrid automata using linear programming
From MaRDI portal
Recommendations
- Positive loop-closed automata: A decidable class of hybrid systems
- Decidability and complexity for the verification of safety properties of reasonable linear hybrid automata
- PTIME parametric verification of safety properties for reasonable linear hybrid automata
- Theoretical Aspects of Computing - ICTAC 2004
- Verification of hybrid systems via mathematical programming
Cited in
(9)- Positive loop-closed automata: A decidable class of hybrid systems
- PTIME parametric verification of safety properties for reasonable linear hybrid automata
- Decidability and complexity for the verification of safety properties of reasonable linear hybrid automata
- Computing approximating automata for a class of linear hybrid systems
- Verification of polyhedral-invariant hybrid automata using polygonal flow pipe approximations
- Software verification based on linear programming
- scientific article; zbMATH DE number 1406216 (Why is no real title available?)
- Deriving Unbounded Reachability Proof of Linear Hybrid Automata during Bounded Checking Procedure
- Symbolic analysis of linear hybrid automata -- 25 years later
This page was built for publication: Efficient verification of a class of linear hybrid automata using linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4787254)