Symbolic Reachability Computation for Families of Linear Vector Fields

✍ Scribed by Gerardo Lafferriere; George J. Pappas; Sergio Yovine

• Publisher: Elsevier Science
• Year: 2001
• Tongue: English
• Weight: 391 KB
• Volume: 32
• Category: Article
• ISSN: 0747-7171
• DOI: 10.1006/jsco.2001.0472

✦ Synopsis

The control paradigm of physical processes being supervised by digital programs has lead to the development of a theory of hybrid systems combining finite state automata with differential equations. One of the most important problems in the verification of hybrid systems is the reachability problem. Even though the computation of reachable spaces for finite state machines is well developed, computing the reachable space of a differential equation is difficult. In this paper, we present the first known families of linear differential 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 differential equations.