Skip to main content

Automata, Circuits, and Hybrids: Facets of Continuous Time

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

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

Included in the following conference series:

Abstract

Classical Automata Theory (AT) is mainly about devices that operate in discrete time. Recent research stimulated the interest to, and the development of, paradigms in which continuous time is involved whether in a pure way or in cooperation with discrete time. This development is in particular evident in the area that covers the following three interrelated trends: automata, logic (arguing about automata) and interaction (composition of automata).

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alur, R., Dill, D.: Automata for modeling real-time systems. Proceedings of ICALP90, LNCS 443 (1990) pp. 332–335.

    Google Scholar 

  2. Alur, R., Fix, L., Henzinger, T.: A deterministic class of timed automata. Proc. CAV’94, LNCS 818, pp. 1–13.

    Google Scholar 

  3. Alur, R., Henzinger, T.: Logics and models for real time: theory in practice. LNCS 600 (1992) pp. 74–106.

    Google Scholar 

  4. Alur, A., Courcoubetis, C., Henzinger, T., Pei-Sin, Ho.: Hybrid automata: approach to the specification and verification of hybrid systems. LNCS 736 (1993) pp. 209–229.

    Google Scholar 

  5. Artstein, Z.: Examples of stabilization with hybrid feedback. LNCS 1066 (1996) pp. 173–185.

    Google Scholar 

  6. Asarin, E., Maler, O., Pnueli, A.: Symbolic controller synthesis for discrete and timed systems, in: Hybrid Systems II, LNCS 999, Springer-Verlag, 1995.

    Google Scholar 

  7. Asarin, E., Bournez, O., Dang, Th., Maler, O., Pnueli, A.: Effective synthesis of switching controllers for linear systems, Proceedings of the IEEE, vol. 88, No 7, July 2000.

    Google Scholar 

  8. Asarin, E., Maler, O., Pnueli, A., Sifakis, J.: Controller synthesis for timed automata, Proc. IFAC Symp. on System Structure and Control, pp. 469–474, Elsevier, 1998.

    Google Scholar 

  9. Berry, G.: The constructive semantics of Pure Esterel, Technical Report (Draft Version 1.2), April 1996.

    Google Scholar 

  10. Broy, M.: Semantics of finite and infinite networks of concurrent communicating agents. Distributed Computing 2 (1987) 13–31.

    Article  MATH  Google Scholar 

  11. Burks, A.W., Wright, J.B.: Theory of logical nets. Proceedings of the I.R.E., 1953.

    Google Scholar 

  12. Davoren, J.M., Nerode, A.: Logics for hybrid systems, Proceedings of the IEEE, vol. 88, No 7, July 2000.

    Google Scholar 

  13. Henzinger, T.: The theory of hybrid automata. Proceedings of the IEEE (1996) 278–292.

    Google Scholar 

  14. Hirshfeld, Y., Rabinovich, A.: A framework for decidable metric logics, Proceedings of the ICALP’99 colloquium, Editors J. Wiedermann, P. van Emde Boas, M. Nielsen, LNCS 1644, Springer-Verlag, 1999, pages 422–432.

    Google Scholar 

  15. Hirshfeld, Y., Rabinovich, A.: Quantitative temporal logic, Proceedings of the CSL colloquium, 1999.

    Google Scholar 

  16. Kobrinsky, N., Trakhtenbrot, B.A.: Introduction to the Theory of Finite Automata (Russian edition, 1962), Transl. North Holland, 1965.

    Google Scholar 

  17. Maler, O.: A unified approach for studying discrete and continuous dynamical systems, Proc. 37th IEEE Conf.Dec. Contr., Tampa, USA, Dec. 1998, pp. 37–42.

    Google Scholar 

  18. Maler, O., Pnueli, A.: Timing analysis of asynchronous circuits using timed automata. Proceedings CHARME’95, LNCS 987, pp. 189–205.

    Google Scholar 

  19. Maler, O., Pnueli, A., Sifakis, J.: On the synthesis of discrete controllers for timed systems, Proceedings of STACS’95, LNCS 900, pp. 229–242.

    Google Scholar 

  20. Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems, Springer-Verlag, 1992.

    Google Scholar 

  21. Manna, Z., Pnueli, A.: Models for reactivity. Acta Informatica 30 (1993) 609–678.

    Article  MATH  MathSciNet  Google Scholar 

  22. McNaughton R.: Badly timed elements and well timed nets. Technical Report 65-02, Moore-School, 1964.

    Google Scholar 

  23. Müller O., Scholz P.: Functional specification of real-time and hybrid systems, LNCS 1201, pp. 273–285, 1997.

    Book  Google Scholar 

  24. Olderog, E.R., Dierks, H.: Decomposing real-time specifications. Intern. Symp. COMPOS’97. LNCS 1536, pp. 465–489.

    Google Scholar 

  25. Pardo, D.: Timed Automata: Transducers and Circuits, M.Sc. Thesis, Tel-Aviv Univ., 1997.

    Google Scholar 

  26. Pardo, D., Rabinovich, A., Trakhtenbrot, B.A.: On synchronous circuits over continuous time, Technical Report, Tel Aviv University, 1997.

    Google Scholar 

  27. Rabinovich, A.: Finite automata over continuous time, Technical Report, Tel Aviv University, 1996.

    Google Scholar 

  28. Rabinovich, A., Trakhtenbrot, B.: From finite automata toward hybrid systems. Proceedings FCT’97, LNCS.

    Google Scholar 

  29. Ramadge P.J., Wonham W.M.: The control of discrete event systems, Proc. of the IEEE’77, pp. 81–98

    Google Scholar 

  30. Sontag, E.: Mathematical Control Theory: Deterministic Finite Dimensional Systems, Springer, N.Y., 1990.

    MATH  Google Scholar 

  31. Sontag, E.: Interconnected automata and linear systems. LNCS, No. 1066 (1996) pp. 436–448.

    Google Scholar 

  32. Trakhtenbrot, B.A.: Automata and hybrid systems. Lecture Notes on a course at Uppsala University, Fall 1997.

    Google Scholar 

  33. Trakhtenbrot, B.A.: Automata, Circuits and Hybrids: Facets of Continuous Time. Work in progress. Manuscript, pp 1–77, Draft March 2001.

    Google Scholar 

  34. Trakhtenbrot, B.A.: Origins and metamorphose of the trinity: Logics, nets, automata, Proceedings, LICS’95.

    Google Scholar 

  35. Trakhtenbrot, B.A.: Automata and their interaction: definitional suggestions, FCT99, LNCS 1684, pp. 54–89, 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Trakhtenbrot, B.A. (2001). Automata, Circuits, and Hybrids: Facets of Continuous Time. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds) Automata, Languages and Programming. ICALP 2001. Lecture Notes in Computer Science, vol 2076. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48224-5_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-48224-5_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42287-7

  • Online ISBN: 978-3-540-48224-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics