Abstract

this paper, we present the first known families of linear di#erential equations with a decidable reachability problem. This is achieved by posing the reachability computation as a quantifier elimination problem in the decidable theory of the reals. We illustrate the applicability of our approach by performing computations using the packages Redlog and Qepcad. Such symbolic computations can be incorporated in computer-aided verification tools for purely discrete systems, resulting in verification tools for hybrid systems with linear di#erential equations

Citations