Reachability in linear dynamical systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5028 LNCS, Issue , 2008, Pages 241-250

  Hainry, Emmanuel ^a  

^a LORIA   (France)

Author keywords

Dynamical Systems; Reachability; Skolem Pisot problem

Indexed keywords

EID: 45849115485     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69407-6_28     Document Type: Conference Paper

References (21)

1. Hirsch, M.W., Smale, S., Devaney, R.: Differential Equations, Dynamical Systems, and an Introduction to Chaos. Elsevier Academic Press (2003)
2. Murray, J.D.: Mathematical Biology, 2nd edn. Biomathematics, vol. 19. Springer, Berlin (1993)
3. Lorenz, E.N.: Deterministic non-periodic flow. Journal of the Atmospheric Sciences 20, 130-141 (1963)
4. 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)
5. Mignotte, M.: Suites récurrentes linéaires. Séminaire Delange-Pisot-Poitou. Théorie des nombres 15, G14-1-G14-9 (1974)
6. 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)
7. 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)
8. Blondel, V., Portier, N.: The presence of a zero in an integer linear recurrent sequence is NP-hard to decide. Linear algebra and its Applications 351-352, 91-98 (2002)
9. Bournez, O.: Complexité algorithmique des systèmes dynamiques continus et hybrides. PhD thesis, École Normale Supérieure de Lyon (1999)
10. Asarin, E., Maler, O., Pnueli, A.: Reachability analysis of dynamical systems having piecewise-constant derivatives. Theoretical Computer Science 138, 35-65 (1995)
11. 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)
12. 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)
13. Blondel, V., Tsitsiklis, J.N.: A survey of computational complexity results in systems and control. Automatica 36(9), 1249-1274 (2000)
14. Kannan, R., Lipton, R.J.: Polynomial-time algorithm for the orbit problem. Journal of the ACM 33(4), 808-821 (1986)
15. Hirsch, M.W., Smale, S.: Differential Equations, Dynamical Systems, and Linear Algebra. Academic Press (1974)
16. Mignotte, M.: An inequality about factors of polynomials. Mathematics of Computation 28(128), 1153-1157 (1974)
17. Bostan, A.: Algorithmique efficace pour des opérations de base en calcul formel. PhD thesis, École polytechnique (2003)
18. Brawley, J.V., Carlitz, L.: Irreducibles and the composed product for polynomials over a finite field. Discrete Mathematics 65(2), 115-139 (1987)
19. Baker, A.: Transcendental Number Theory. Cambridge University Press (1990)
20. Gelfond, A.O.: Transcendental and Algebraic Numbers. Dover Publications (2003)
21. Lelong-Ferrand, J., Arnaudiès, J.M.: Cours de mathé matiques, tome 1: algèbre. Dunod (1971)