Reachability analysis of dynamical systems having piecewise-constant derivatives, Theoretical Computer Science, vol.138, pp.35-65, 1995. ,
Widening the boundary between decidable and undecidable hybrid systems, CONCUR 2002 -Concurrency Theory, 13th International Conference, pp.193-208, 2002. ,
On the decidability of the reachability problem for planar differential inclusions, Hybrid Systems: Computation and Control, pp.89-104, 2001. ,
The Continuous Skolem- Pisot Problem: On the Complexity of Reachability for Linear Ordinary Differential Equations, 2008. ,
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. ,
A survey of computational complexity results in systems and control, Automatica, vol.36, issue.9, pp.1249-1274, 2000. ,
Irreducibles and the composed product for polynomials over a finite field, Discrete Mathematics, vol.65, issue.2, pp.115-139, 1987. ,
Computational bounds on polynomial differential equations, Applied Mathematics and Computation, 2008. ,
Robust simulations of Turing machines with analytic maps and flows, CiE 2005: New Computational Paradigms, pp.169-179, 2005. ,
Analog computers and recursive functions over the reals, Journal of Complexity, vol.19, issue.5, pp.644-664, 2003. ,
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. ,
Skolem's problem -on the border between decidability and undecidability, 2005. ,
Differential Equations, Dynamical Systems, and an Introduction to Chaos, 2003. ,
Polynomial-time algorithm for the orbit problem, Journal of the ACM, vol.33, issue.4, pp.808-821, 1986. ,
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. ,
Modern Computer Algebra, 2003. ,