2023/09/14 by Éric Goubault, Goubault, Eric, Sylvie Putot +1
Computer Science · #68W99 #FOS: Computer and information sciences #FOS: Electrical engineering #Formal Methods in Verification #G.1.2 #Logic in Computer Science (cs.LO) #Numerical Methods and Algorithms #Robotic Path Planning Algorithms #Systems and Control (eess.SY) #electronic engineering #information engineering
paper · pdf · doi:10.48550/arxiv.2309.07662
openalex publication_date 2023/09/14 · openalex created_date 2023/09/16 · openalex updated_date 2026/07/28
We propose an approach to compute inner and outer-approximations of the sets of values satisfying constraints expressed as arbitrarily quantified formulas. Such formulas arise for instance when specifying important problems in control such as robustness, motion planning or controllers comparison. We propose an interval-based method which allows for tractable but tight approximations. We demonstrate its applicability through a series of examples and benchmarks using a prototype implementation.