Skip to main content
SpringerLink
Log in

On some relations between dynamical systems and transition systems

  • Conference paper
  • First Online:
Book cover Automata, Languages and Programming (ICALP 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 820))

Included in the following conference series:

Abstract

In this paper we define a precise notion of abstraction relation between continuous dynamical systems and discrete state-transition systems. Our main result states that every Turing Machine can be realized by a dynamical system with piecewise-constant derivatives in a 3-dimensional space and thus the reachability problem for such systems is undecidable for 3 dimensions. A decision procedure for 2-dimensional systems has been recently reported by Maler and Pnueli. On the other hand we show that some non-deterministic finite automata cannot be realized by any continuous dynamical system with less than 3 dimensions.

This research was supported in part by the France-Israel project for cooperation in Computer Science, by the European Community ESPRIT Basic Research Action Projects REACT (6021) and by Research Grant #93-012-884 of the Russian Foundation of Fundamental Research. Verimag is a joint laboratory of cnrs, inpg, ujf and Verilog sa. Spectre is a project of inria. The final version was prepared while the first author was visiting the Dept. of Mathematics of the University Paris 12 — Val de Marne.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Abadi and L. Lamport, On the existence of refinement mappings, in Proc. of the Third Annual Symposium on Logic in Computer Science, pages 165–175. IEEE Computer Society Press, 1988.

    Google Scholar 

  2. R. Alur and D.L. Dill, Automata for modeling real-time systems, In M.S. Paterson, editor, Proc. of ICALP'90, Lect. Notes in Comp. Sci. 443, pages 322–335, Springer-Verlag, 1993.

    Google Scholar 

  3. R. Alur, C. Courcoubetis, T. Henzinger, and P. Ho, Hybrid automata: An algorithmic approach to the specification and analysis of hybrid systems. In A. Ravn and H. Rischel, editors, Workshop on Hybrid Systems, Lect. Notes in Comp. Sci. Springer-Verlag, 1993.

    Google Scholar 

  4. R.W. Brockett, Smooth dynamical systems which realize arithmetical and logical operations, In H. Nijmeijer and J.M. Schumacher, editors, Three Decades of Mathematical Systems Theory, pages 19–30, Lect. Notes in Control and Information Sciences, Springer-Verlag, 1989.

    Google Scholar 

  5. A. Brondsted, An Introduction to Convex Polytopes, Springer-Verlag, New-York, 1983.

    Google Scholar 

  6. M. Cosnard, M. Garzon and P. Koiran, Computability properties of lowdimensional dynamical systems, In P. Enjalbert, A. Finkel and K.W. Wagner, editors, Proc. of the 10th Ann. Symp. on Theoretical Aspects of Computer Science, pages 365–373, Lect. Notes in Comp. Sci. 665, Springer-Verlag, 1993.

    Google Scholar 

  7. R.A. DeMillo and R.J. Lipton, Defining software by continuous smooth functions, IEEE Trans. on Software Engineering, Vol. 17, No. 4, 1991.

    Google Scholar 

  8. Y. Kesten, A. Pnueli, J. Sifakis, and S. Yovine, Integration graphs: A class of decidable hybrid systems, In A. Ravn and H. Rischel, editors, Workshop on Hybrid Systems, Lect. Notes in Comp. Sci. Springer-Verlag, 1993.

    Google Scholar 

  9. O. Maler, Z. Manna, and A. Pnueli, From timed to hybrid systems, In J.W. de Bakker, C. Huizing, W.P. de Roever, and G. Rozenberg, editors, Proceedings of the REX Workshop ”Real-Time: Theory in Practice“, volume 600 of Lect. Notes in Comp. Sci., pages 447–484. Springer-Verlag, 1992.

    Google Scholar 

  10. O. Maler and A. Pnueli, Reachability analysis of planar multi-linear systems, In C. Courcoubetis, editor, Proc. of the 5th Workshop on Computer-Aided Verification, Elounda, Greece, volume 697 of Lect. Notes in Comp. Sci., pages 194–209. Springer-Verlag, 1993.

    Google Scholar 

  11. H. Putnam. Representation and Reality, MIT Press, Cambridge, MA, 1988.

    Google Scholar 

  12. X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine, An approach to the description and analysis of hybrid systems, In A. Ravn and H. Rischel, editors, Workshop on Hybrid Systems, Lect. Notes in Comp. Sci. Springer-Verlag, 1993.

    Google Scholar 

  13. J.H. Reif, J.D. Tygar, and A. Yoshida, The computability and complexity of optical beam tracing, in Proc. 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, 106–114, IEEE Press 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Information Transmission Problems, 19 Ermolovoy st., Moscow, Russia

    Eugene Asarin

  2. Spectre - Verimag Miniparc-zirst, 38330, Montbonnot, France

    Oded Maler

Authors
  1. Eugene Asarin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Oded Maler
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Serge Abiteboul Eli Shamir

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Asarin, E., Maler, O. (1994). On some relations between dynamical systems and transition systems. In: Abiteboul, S., Shamir, E. (eds) Automata, Languages and Programming. ICALP 1994. Lecture Notes in Computer Science, vol 820. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58201-0_58

Download citation

  • DOI: https://doi.org/10.1007/3-540-58201-0_58

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58201-4

  • Online ISBN: 978-3-540-48566-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation