On the computational power of dynamical systems and hybrid systems

Theoretical Computer Science

Volumn 168, Issue 2, 1996, Pages 417-459

  Bournez, Olivier ^a   Cosnard, Michel ^a  

^a UNIVERSITÉ DE LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ANALOG COMPUTERS; COMPUTER SIMULATION; MATHEMATICAL MODELS;

ANALOG AUTOMATON MODEL; DYNAMICAL SYSTEMS;

AUTOMATA THEORY;

EID: 0030286788     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00086-2     Document Type: Article

References (29)

1. R. Alur, C. Courcoubetis, N. Halbwachs, T.A. Henzinger, P.H. Ho, X. Nicollin, A. Olivero, J. Sifakis and S. Yovine. The algorithmic analysis of hybrid systems, Theoret. Comput. Sci. 138 (1195) 3-34.
2. R. Alur, C. Courcoubetis, T.A. Henzinger, and Pei-Hsin Ho. Hybrid automata: an algorithmic approach to the specification and verification of hybrid systems, Lecture Notes in Computer Science, Vol. 736 (Springer, Berlin, 1993) 340-354.
3. E. Asarin and O Maler, On some relations between dynamical systems and transition systems, in: Proc. ICALP, Lecture Notes in Computer Science, Vol. 820 (Springer, Berlin, 1994) 59-72.
4. E. Asarin and O, Maler, Achilles and the tortoise climbing up the arithmetical hierarchy, in Proc. FST/TCS'95, Lecture Notes in Computer Science, Vol. 1026 (Springer, Berlin, 1995) 471-483.
5. E. Asarin, O. Maler and A. Pnueli, Reachability analysis of dynamical systems having piecewise-constant derivatives, Theoret. Comput. Sci. 138 (1995) 33-65.
6. J.L. Balcázar, J. Diáz and J. Gabarŕo, Structural Complexity I, EATCS Monographs on Theoretical Computer Science, 1988.
7. C.H. Bennett, Logical reversibility of computation, IBM J. Res. Dev. 6 (1973) 525-532.
8. L. Blum, M. Shub, and S. Smale, On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines, Bull. Amer. Math. Soc. 21 (1989) 1-46.
9. M.S. Branicky, Universal computation and other capabilities of hybrid and continuous dynamical systems, Theoret. Comput. Sci. 138 (1995) 67-100.
10. K. Čerāns, Decidability of bissimulation equivalences for parallel timer processes, Lecture Notes in Computer Science, Vol. 663 (Springer, Berlin, 1992) 269-300.
11. J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory Languages and Computation. (Addison-Wesley, Reading, MA, 1979).
12. Y. Kesten, A. Pnueli, J. Sifakis and S. Yovine, Integration graphs: a class of decidable hybrid systems, Lecture Notes in Computer Science, Vol. 736 (Springer, Berlin, 1193) 179-208.
13. P. Koiran, On the relations between dynamical systems and boolean circuits, Tech. Report 01, École Normale Supérieure de Lyon, January 1993.
14. P. Koiran, Puissance de Calcul des réseaux de neurones artificiels, Ph.D. Thesis, École Normale Supérieure de Lyon, June 1993.
15. P. Koiran, A weak version of the blum shub smale model, Tech. Report 005, NeuroCOLT Technical Report Series, August 1994. A preliminary version can be found in Proc. 34th IEEE Symp. on Foundations of Computer Science (1993) 486-495.
16. P. Koiran, A weak version of the blum shub smale model, Tech. Report 005, NeuroCOLT Technical Report Series, August 1994. A preliminary version can be found in Proc. 34th IEEE Symp. on Foundations of Computer Science (1993) 486-495.
17. P. Koiran, Computing over the reals with addition and order. Theoret. Comput. Sci. 133 (1994) 35-47.
18. P. Koiran, M. Cosnard and M. Garzon, Computability with low-dimensional dynamical systems, Theoret. Comput. Sci. 132 (1994) 113-128.
19. O. Maler and A. Pnueli, Reachability analysis of planar multi-linear systems, Lecture Notes in Computer Science, Vol 697 (1995) Springer, Berlin, 194-209.
20. K. Meer and C. Michaux, A survey on real structural complexity theory, Bull. Belgian Math. Soc. -Simon Stevin, to appear.
21. C. Moore, Unpredictability and undecidability in dynamical systems, Phys. Rev. Lett. 64 (1990) 2354-2357.
22. C. Moore, Generalized shifts: unpredictability and undecidability in dynamical systems, Nonlinearity 4 (1991) 199-230.
23. X. Nicollin, A. Olivero, J. Sifakis and S. Yovine, An approach to the description and analysis of hybrid systems. Lecture Notes in Computer Science, Vol. 736 (Springer, Berlin, 1993) 149-178.
24. X. Nicollin, J. Sifakis and S. Yovine, From ATP to timed graphs and hybrid systems, Acta Inform., 30 (1993) 181-202.
25. H.T. Siegelmann, The simple dynamics of super Turing theories, Techn. Report NN-1, Technion, 1994.
26. H.T. Siegelmann, Computation beyond the Turing limit, Science 268 (1995) 545-548.
27. H.T. Siegelmann and E.D. Sontag. Analog computation via neural networks, Theoret. Comput. Sci. 131 (1994) 331-360.
28. E. Sontag, From linear to nonlinear: some complexity comparisons, in: IEEE Conf. Decision and Control, New Orleans (1995) 2916-2920.
29. E.D. Sontag, Nonlinear regulation: the piecewise linear approach, IEEE Trans. Automatic Control AC-26 (1981).