Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints

DOI10.1007/978-3-642-00768-2_32zbMath1234.68266OpenAlexW2147222082MaRDI QIDQ3617770

Christoph Scholl, Florian Pigorsch, Stefan Disch, Stefan Kupferschmid

Publication date: 31 March 2009

Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00768-2_32

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (3)

Minimal representations of a face of a convex polyhedron and some applications ⋮ Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces ⋮ Algorithms for computing minimal equivalent subformulas

Uses Software

• Unnamed Item
• SMT-LIB
• PHAVer
• HyTech
• REDLOG
• SIMPLIFY
• MathSAT
• CVC

Cites Work

• Unnamed Item
• Unnamed Item
• HyTech: A model checker for hybrid systems
• Applying Linear Quantifier Elimination
• Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory
• Exact State Set Representations in the Verification of Linear Hybrid Systems with Large Discrete State Space
• Automatic Verification of Hybrid Systems with Large Discrete State Space
• Automating Verification of Cooperation, Control, and Design in Traffic Applications
• Simplify: a theorem prover for program checking
• Lower bounds for resolution and cutting plane proofs and monotone computations
• Theory and Applications of Satisfiability Testing
• Hybrid Systems: Computation and Control
• Don’t Care Words with an Application to the Automata-Based Approach for Real Addition
• Computer Aided Verification

This page was built for publication: Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints