Reachability in linear dynamical systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2008

Reachability in linear dynamical systems


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.
Fichier principal
Vignette du fichier
dynsys_hal.pdf (163.82 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00202674 , version 1 (07-01-2008)
inria-00202674 , version 2 (16-04-2008)



Emmanuel Hainry. Reachability in linear dynamical systems. Computability in Europe, Jun 2008, Athènes, Greece. pp.241-250, ⟨10.1007/978-3-540-69407-6_28⟩. ⟨inria-00202674v2⟩
100 View
463 Download



Gmail Facebook X LinkedIn More