A. , E. M????, O. ???-p?????, and A. , Reachability analysis of dynamical systems having piecewise-constant derivatives, Theoretical Computer Science, vol.138, pp.35-65, 1995.

A. , E. ???-s????????, and G. , Widening the boundary between decidable and undecidable hybrid systems, CONCUR 2002 -Concurrency Theory, 13th International Conference, pp.193-208, 2002.

A. , E. S????????, G. ???-y?????, and S. , On the decidability of the reachability problem for planar differential inclusions, Hybrid Systems: Computation and Control, pp.89-104, 2001.

B. , P. D???????, J. J??????, R. ???-b??????, and V. D. , The Continuous Skolem- Pisot Problem: On the Complexity of Reachability for Linear Ordinary Differential Equations, 2008.

B. , V. ???-p??????, and N. , The presence of a zero in an integer linear recurrent sequence is NP-hard to decide. Linear algebra and its Applications, pp.351-352, 2002.

B. , V. ???-t?????????, and J. N. , A survey of computational complexity results in systems and control, Automatica, vol.36, issue.9, pp.1249-1274, 2000.

B. , J. V. ???-c??????, and L. , Irreducibles and the composed product for polynomials over a finite field, Discrete Mathematics, vol.65, issue.2, pp.115-139, 1987.

G. , D. S. B?????, J. ???-c?????????, and M. L. , Computational bounds on polynomial differential equations, Applied Mathematics and Computation, 2008.

G. , D. S. C?????????, M. L. ???-b?????, and J. , Robust simulations of Turing machines with analytic maps and flows, CiE 2005: New Computational Paradigms, pp.169-179, 2005.

G. , D. S. ???-c????, and J. F. , Analog computers and recursive functions over the reals, Journal of Complexity, vol.19, issue.5, pp.644-664, 2003.

H. , S. R??????, L. ???-s????, and M. , On the computational power of timed differentiable Petri nets, International Conference on Formal Modelling and Analysis of Timed Systems, FORMATS'06, pp.230-244, 2006.

H. , V. H????, T. H?????????, M. ???-k?????¨???k?????¨???, and J. , Skolem's problem -on the border between decidability and undecidability, 2005.

H. , M. W. S????, S. ???-d??????, and R. , Differential Equations, Dynamical Systems, and an Introduction to Chaos, 2003.

K. , R. ???-l?????, and R. J. , Polynomial-time algorithm for the orbit problem, Journal of the ACM, vol.33, issue.4, pp.808-821, 1986.

K. , P. ???-m????, and C. , Closed-form analytic maps in one and two dimensions can simulate universal Turing machines, Theoretical Computer Science, vol.210, issue.1, pp.217-223, 1999.

?. ???-g?????, J. ???-g??????, and J. , Modern Computer Algebra, 2003.