Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Fundamentals of Computation Theory

FCT 1997: Fundamentals of Computation Theory pp 411–422Cite as

From finite automata toward hybrid systems (Extended abstract)

  • Technical Contributions
  • Conference paper
  • First Online:

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

Abstract

We consider two orthogonal extensions of the basic finite automaton paradigm and clarify to what degree and in what form do they preserve fundamental facts from the theory of finite automata. Hopefully, this approach facilitates a lucid adaptation of Automata Theory to Hybrid Systems.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Abadi and L. Lamport. An Old-Fashioned Recipe for Real Time. In ACM Toplas 16, 5:1543–1571,1994.

    Article  Google Scholar 

  2. R. Alur, C. Courcubetis, T. Henzinger and P. Ho. Hybrid Automata, an algorithmic approach to the specification and verification of hybrid systems. LNCS 736, 1993.

    Google Scholar 

  3. R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126:183–235,1994.

    Article  Google Scholar 

  4. R. Alur, T. Henzinger and P. Ho. Automatic Symbolic Verification of Embedded Systems, 1993.

    Google Scholar 

  5. T. Henzinger. A theory of hybrid automata. In Proceedings of LICS, 1996.

    Google Scholar 

  6. N. Kobrinski and B. A. Trakhtenbrot. Introduction to the theory of Finite Automata, North Holland 1965.

    Google Scholar 

  7. S. Kleene. Representation of events in nerve nets and finite automata. Automata Studies, 32-41, Princeton, 1956.

    Google Scholar 

  8. O. Maler, A. Pnueli and J. Sifakis. On the synthesis of discrete controller for timed systems. In Theoretical Aspects of Computer Science, LNCS vol 900, 1995.

    Google Scholar 

  9. R. McCulloch and W. Pitts. A logical calculus of the ideas immanent inn nervous activity. Bull., Math. Biophysics, 5, 1943, pp. 115–133.

    Google Scholar 

  10. D. Pardo,A. Rabinovich and B. A. Trakhtenbrot. On Synchronous Circuits over Continuous Time. Technical Report Tel Aviv University, 1997. Available at http://www.math.tau.ac.il/-rabino.

    Google Scholar 

  11. B. Trakhtenbrot. Origins and Metamorphoses of the Trinity: Logics, Nets, Automata. In Proceedings of LICS, 1995.

    Google Scholar 

  12. D. Scott. Some definitional suggestions for automata theory. J. of Computer and System Science, 1967, pp.187–212.

    Google Scholar 

  13. T. Wilke. Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata, FTFRFT, 1994. *** DIRECT SUPPORT *** A0008123 00011

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Tel Aviv University, 69978, Tel Aviv, Israel

    A. Rabinovich & B. A. Trakhtenbrot

Authors
  1. A. Rabinovich
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. B. A. Trakhtenbrot
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Bogdan S. Chlebus Ludwik Czaja

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rabinovich, A., Trakhtenbrot, B.A. (1997). From finite automata toward hybrid systems (Extended abstract). In: Chlebus, B.S., Czaja, L. (eds) Fundamentals of Computation Theory. FCT 1997. Lecture Notes in Computer Science, vol 1279. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036202

Download citation

  • DOI: https://doi.org/10.1007/BFb0036202

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63386-0

  • Online ISBN: 978-3-540-69529-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation