Counterexample-Guided Refinement of Template Polyhedra
From MaRDI portal
Recommendations
- Template polyhedra and bilinear optimization
- Using Counterexamples for Improving the Precision of Reachability Computation with Polyhedra
- Generalizing the template polyhedral domain
- Defect polytopes and counter-examples with polymake
- On the refinements of a polyhedral subdivision
- Separation and approximation of polyhedral objects
- scientific article; zbMATH DE number 742976
- Templatized refinement of triangle meshes using surface interpolation
- Polyhedral approaches
Cites work
- Abstraction and Counterexample-Guided Refinement in Model Checking of Hybrid Systems
- An exact duality theory for semidefinite programming and its complexity implications
- Eliminating spurious transitions in reachability with support functions
- Flowpipe approximation and clustering in space-time
- Formal Modeling and Analysis of Timed Systems
- Grammar Analysis and Parsing by Abstract Interpretation
- scientific article; zbMATH DE number 1670775 (Why is no real title available?)
- scientific article; zbMATH DE number 1263213 (Why is no real title available?)
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- scientific article; zbMATH DE number 1956582 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Hybrid Systems: Computation and Control
- Image Computation for Polynomial Dynamical Systems Using the Bernstein Expansion
- Lazy abstraction
- Lazy Abstraction with Interpolants
- Parallelotope Bundles for Polynomial Reachability
- Path-oriented reachability verification of a class of nonlinear hybrid automata using convex programming
- Quantifier-free encoding of invariants for hybrid systems
- Reachability Analysis of Hybrid Systems Using Support Functions
- Reachability analysis of polynomial systems using linear programming relaxations
- Reachability for Linear Hybrid Automata Using Iterative Relaxation Abstraction
- Second-order cone programming
- Symbolic Model Checking of Hybrid Systems Using Template Polyhedra
- Using redundant constraints for refinement
- Verification, Model Checking, and Abstract Interpretation
Cited in
(13)- Unbounded-time safety verification of guarded LTI models with inputs by abstract acceleration
- Decomposing reach set computations with low-dimensional sets and high-dimensional matrices (extended version)
- Template polyhedra and bilinear optimization
- Template-based unbounded time verification of affine hybrid automata
- A Counterexample-Guided Approach to Parameter Synthesis for Linear Hybrid Automata
- Geometric Model Checking of Continuous Space
- Defect polytopes and counter-examples with polymake
- Using Counterexamples for Improving the Precision of Reachability Computation with Polyhedra
- Symbolic analysis of linear hybrid automata -- 25 years later
- Using Intersection of Unions to Minimize Multi-directional Linearization Error in Reachability Analysis
- Fully-Automated Verification of Linear Systems Using Reachability Analysis with Support Functions
- On bisimilarity for polyhedral models and \texttt{SLCS}
- Revisiting polyhedral analysis for hybrid systems
This page was built for publication: Counterexample-Guided Refinement of Template Polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3303915)
