Revisiting polyhedral analysis for hybrid systems
From MaRDI portal
Publication:6536287
Recommendations
- Efficient geometric operations on convex polyhedra, with an application to reachability analysis of hybrid systems
- Counterexample-Guided Refinement of Template Polyhedra
- scientific article; zbMATH DE number 2085314
- Symbolic analysis of linear hybrid automata -- 25 years later
- Conic abstractions for hybrid systems
Cites work
- A constraint solver based on abstract domains
- A direct encoding for NNC polyhedra
- An efficient abstract domain for not necessarily closed polyhedra
- Applications of polyhedral computations to the analysis and verification of hardware and software systems
- Convexity recognition of the union of polyhedra
- Fast polyhedra abstract domain
- scientific article; zbMATH DE number 2090856 (Why is no real title available?)
- scientific article; zbMATH DE number 3078984 (Why is no real title available?)
- Hybrid Systems: Computation and Control
- HyTech: A model checker for hybrid systems
- Not necessarily closed convex polyhedra and the double description method
- Precise widening operators for convex polyhedra
- Reachability Analysis of Hybrid Systems Using Support Functions
- Scalable Minimizing-Operators on Polyhedra via Parametric Linear Programming
- Some ways to reduce the space dimension in polyhedra computations
- The octagon abstract domain
- Verification, Model Checking, and Abstract Interpretation
This page was built for publication: Revisiting polyhedral analysis for hybrid systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536287)