Abstract
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 ω-limit set is a semi-algebraic set. The algorithm to compute this set can easily be derived from this proof.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Asarin, E., Maler, O., Pnueli, A.: Reachability analysis of dynamical systems having piecewise-constant derivatives. Theoretical Computer Science 138, 35–65 (1995)
Asarin, E., Schneider, G.: Widening the boundary between decidable and undecidable hybrid systems. In: Brim, L., Jančar, P., Křetínský, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 193–208. Springer, Heidelberg (2002)
Asarin, E., Schneider, G., Yovine, S.: On the decidability of the reachability problem for planar differential inclusions. In: Di Benedetto, M.D., Sangiovanni-Vincentelli, A.L. (eds.) HSCC 2001. LNCS, vol. 2034, pp. 89–104. Springer, Heidelberg (2001)
Berstel, J., Mignotte, M.: Deux propriétés décidables des suites récurrentes linéaires. Bulletin de la Société Mathématique de France 104, 175–184 (1976)
Blondel, V., Tsitsiklis, J.N.: A survey of computational complexity results in systems and control. Automatica 36(9), 1249–1274 (2000)
Bostan, A.: Algorithmique efficace pour des opérations de base en calcul formel. PhD thesis, École polytechnique, décembre (2003)
Bournez, O.: Complexité algorithmique des systèmes dynamiques continus et hybrides. PhD thesis, École Normale Supérieure de Lyon, janvier (1999)
Brawley, J.V., Carlitz, L.: Irreducibles and the composed product for polynomials over a finite field. Discrete Mathematics 65(2), 115–139 (1987)
Cohen, H.: A Course in Computational Algebraic Number Theory. Springer, Heidelberg (1993)
Graça, D.S., Campagnolo, M.L., Buescu, J.: Robust simulations of Turing machines with analytic maps and flows. In: Cooper, S.B., Löwe, B., Torenvliet, L. (eds.) CiE 2005. LNCS, vol. 3526, pp. 169–179. Springer, Heidelberg (2005)
Halava, V., Harju, T., Hirvensalo, M., Karhumäki, J.: Skolem’s problem - on the border between decidability and undecidability. Technical Report 683, Turku Center for Computer Science (2005)
Hirsch, M.W., Smale, S., Devaney, R.: Differential Equations, Dynamical Systems, and an Introduction to Chaos. Elsevier Academic Press, Amsterdam (2003)
Hirsch, M.W., Smale, S.: Differential Equations, Dynamical Systems, and Linear Algebra. Academic Press, London (1974)
Lelong-Ferrand, J., Arnaudiès, J.-M.: Cours de mathématiques, tome 1: algèbre. Dunod (1971)
Lorenz, E.N.: Deterministic non-periodic flow. Journal of the Atmospheric Sciences 20, 130–141 (1963)
Mignotte, M.: An inequality about factors of polynomials. Mathematics of Computation 28(128), 1153–1157 (1974)
Mignotte, M.: Suites récurrentes linéaires. In: Séminaire Delange-Pisot-Poitou. Théorie des nombres, vol. 15, pp. G14–1–G14–9 (1974)
Murray, J.D.: Mathematical Biology, 2nd edn. Biomathematics, vol. 19. Springer, Berlin (1993)
von zur Gathen, J., Gerhard, J.: Modern Computer Algebra. Cambridge University Press, Cambridge (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hainry, E. (2008). Computing Omega-Limit Sets in Linear Dynamical Systems. In: Calude, C.S., Costa, J.F., Freund, R., Oswald, M., Rozenberg, G. (eds) Unconventional Computing. UC 2008. Lecture Notes in Computer Science, vol 5204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85194-3_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-85194-3_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85193-6
Online ISBN: 978-3-540-85194-3
eBook Packages: Computer ScienceComputer Science (R0)