Reachability in linear dynamical systems
Abstract
Dynamical systems allow to modelize various phenomena or processes by only describing their local behaviour. It is however useful to understand the behaviour in a more global way. Checking the reachability of a point for example is a fundamental problem. In this document we will show that this problem that is undecidable in the general case is in fact decidable for a natural class of continuous-time dynamical systems: linear systems. For this, we will use results from the algebraic numbers theory such as Gelfond-Schneider's theorem.
Origin : Files produced by the author(s)
Loading...