Abstract
We present an extrapolation with care set operator to accelerate termination of reachability computation with polyhedra. At the same time, a counterexample guided refinement algorithm is used to iteratively expand the care set to improve the precision of the reachability computation. We also introduce two heuristic algorithms called interpolate and restrict to minimize the polyhedral representations without reducing the accuracy. We present some promising experimental results from a preliminary implementation of these techniques. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Wang, C., Yang, Z., Gupta, A., & Ivančić, F. (2007). Using counterexamples for improving the precision of reachability computation with polyhedra. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4590 LNCS, pp. 352–365). Springer Verlag. https://doi.org/10.1007/978-3-540-73368-3_40
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
