Computing Omega-Limit Sets in Linear Dynamical Systems

Dynamical systems allow to modelize various phenomena or processes by only describing their way of evolution. It is an important matter to study the global and the limit behaviour of such systems. A possible description of this limit behaviour is via the omega-limit set: the set of points that can be limit of subtrajectories. The omega-limit set is in general uncomputable. It can be a set highly difficult to apprehend. Some systems have for example a fractal omega-limit set. However, in some specific cases, this set can be computed. This problem is important to verify properties of dynamical systems, in particular to predict its collapse or its infinite expansion. We prove in this paper that for linear continuous time dynamical systems, it is in fact computable. More, we also prove that the i¾?-limit set is a semi-algebraic set. The algorithm to compute this set can easily be derived from this proof.

[1]  Alin Bostan,et al.  Algorithmique efficace pour des opérations de base en calcul formel. (Fast algorithms for basic operations in computer algebra) , 2003 .

[2]  Amir Pnueli,et al.  Reachability Analysis of Dynamical Systems Having Piecewise-Constant Derivatives , 1995, Theor. Comput. Sci..

[3]  John N. Tsitsiklis,et al.  A survey of computational complexity results in systems and control , 2000, Autom..

[4]  É. Lucas.  Theorie des Nombres Vol. 1 , 1962 .

[5]  Daniel S. Graça,et al.  Robust Simulations of Turing Machines with Analytic Maps and Flows , 2005, CiE.

[6]  Olivier Bournez.  Complexite algorithmique des systemes dynamiques continus et hybrides , 1999 .

[7]  L. Carlitz,et al.  Irreducibles and the composed product for polynomials over a finite field , 1987, Discret. Math..

[8]  Thomas A. Henzinger,et al.  Hybrid Systems: Computation and Control , 1998, Lecture Notes in Computer Science.

[9]  Henri Cohen,et al.  A course in computational algebraic number theory , 1993, Graduate texts in mathematics.

[10]  Benedikt Löwe,et al.  New Computational Paradigms , 2005 .

[11]  R. Gregory Taylor,et al.  Modern computer algebra , 2002, SIGA.

[12]  M. Hirsch,et al.  Differential Equations, Dynamical Systems, and an Introduction to Chaos , 2003 .

[13]  E. Lorenz.  Deterministic nonperiodic flow , 1963 .

[14]  J. Berstel,et al.  Deux propriétés décidables des suites récurrentes linéaires , 1976 .

[15]  Joachim von zur Gathen,et al.  Modern Computer Algebra , 1998 .

[16]  Sergio Yovine,et al.  On the Decidability of the Reachability Problem for Planar Differential Inclusions , 2001, HSCC.

[17]  Kousha Etessami,et al.  A Hierarchy of Polynomial-Time Computable Simulations for Automata , 2002, CONCUR.

[18]  M. Mignotte.  An inequality about factors of polynomials , 1974 .

[19]  Eugene Asarin,et al.  Widening the Boundary between Decidable and Undecidable Hybrid Systems , 2002, CONCUR.

[20]  Maurice Mignotte.  Suites récurrentes linéaires , 1974 .

[21]  M. Hirsch,et al.  Differential Equations, Dynamical Systems, and Linear Algebra , 1974 .

[22]  Between Decidability.  Skolem's Problem - On the Border , 2005 .