Revisiting polyhedral analysis for hybrid systems

DOI10.1007/978-3-030-32304-2_10zbMATH Open1539.68149MaRDI QIDQ6536287

Anna Becchi, Enea Zaffanella

Publication date: 19 April 2024

Mathematics Subject Classification ID

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Some ways to reduce the space dimension in polyhedra computations
• The octagon abstract domain
• Applications of polyhedral computations to the analysis and verification of hardware and software systems
• HyTech: A model checker for hybrid systems
• Precise widening operators for convex polyhedra
• Not necessarily closed convex polyhedra and the double description method
• A Constraint Solver Based on Abstract Domains
• Reachability Analysis of Hybrid Systems Using Support Functions
• Scalable Minimizing-Operators on Polyhedra via Parametric Linear Programming
• Fast polyhedra abstract domain
• Hybrid Systems: Computation and Control
• Verification, Model Checking, and Abstract Interpretation
• Convexity recognition of the union of polyhedra
• An efficient abstract domain for not necessarily closed polyhedra
• A direct encoding for NNC polyhedra

This page was built for publication: Revisiting polyhedral analysis for hybrid systems