Simple and precise widenings for H-polyhedra

4Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

While the definition of the revised widening for polyhedra is defined in terms of inequalities, most implementations use the double description method as a means to an efficient implementation. We show how standard widening can be implemented in a simple and efficient way using a normalized H-representation (constraint-only) which has become popular in recent approximations to polyhedral analysis. We then detail a novel heuristic for this representation that is tuned to capture linear transformations of the state space while ensuring quick convergence for non-linear transformations for which no precise linear invariants exist. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Simon, A., & Chen, L. (2010). Simple and precise widenings for H-polyhedra. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6461 LNCS, pp. 139–155). https://doi.org/10.1007/978-3-642-17164-2_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free