inria-00202674, version 2
Reachability in linear dynamical systems
Computability in Europe 5028 (2008) 241-250
Résumé : 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.
- a – Université Henri Poincaré - Nancy I
- 1 : CARTE (INRIA Lorraine - LORIA)
- CNRS : UMR7503 – INRIA – Université Henri Poincaré - Nancy I – Université Nancy II – Institut National Polytechnique de Lorraine (INPL)
- Domaine : Informatique/Autre
- Mots-clés : Dynamical Systems – Reachability – Skolem-Pisot problem – Gelfond-Schneider Theorem
- Versions disponibles : v1 (07-01-2008) v2 (16-04-2008)
- inria-00202674, version 2
- http://hal.inria.fr/inria-00202674
- oai:hal.inria.fr:inria-00202674
- Contributeur : Emmanuel Hainry
- Soumis le : Mercredi 16 Avril 2008, 15:53:48
- Dernière modification le : Mercredi 8 Octobre 2008, 15:10:37
Documents associés
Exporter