On the Underapproximation of Reach Sets of Abstract Continuous-Time Systems

Ievgen Ivanov
(Taras Shevchenko National University of Kyiv)

We consider the problem of proving that each point in a given set of states ("target set") can indeed be reached by a given nondeterministic continuous-time dynamical system from some initial state. We consider this problem for abstract continuous-time models that can be concretized as various kinds of continuous and hybrid dynamical systems.

The approach to this problem proposed in this paper is based on finding a suitable superset S of the target set which has the property that each partial trajectory of the system which lies entirely in S either is defined as the initial time moment, or can be locally extended backward in time, or can be locally modified in such a way that the resulting trajectory can be locally extended back in time.

This reformulation of the problem has a relatively simple logical expression and is convenient for applying various local existence theorems and local dynamics analysis methods to proving reachability which makes it suitable for reasoning about the behavior of continuous and hybrid dynamical systems in proof assistants such as Mizar, Isabelle, etc.

In Erika Ábrahám and Sergiy Bogomolov: Proceedings 3rd International Workshop on Symbolic and Numerical Methods for Reachability Analysis (SNR 2017), Uppsala, Sweden, 22nd April 2017, Electronic Proceedings in Theoretical Computer Science 247, pp. 46–51.
Published: 8th April 2017.

ArXived at: https://dx.doi.org/10.4204/EPTCS.247.4 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org