Skip to main content
SpringerLink
Log in

Automata and their interaction: Definitional suggestions

  • Conference paper
  • First Online:
Book cover Fundamentals of Computation Theory (FCT 1999)

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

Included in the following conference series:

Abstract

There is a growing feeling in the community that the current literature on reactive and hybrid systems is plagued by a Babel of models, constructs and formalisms, and by an amazing discord of terminology and notation. Further models and formalisms are engendered, and it is not clear where to stop.

Hence, the urge toward a pithy conceptual/notational setting, supported by a consistent and comprehensive taxonomy for a wide range of formalisms and models.

The paper outlines an automata-based approach to this challenge, which emerged in previous research [PRT, RT] and in teaching experience [T1,

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Abramsky, S.: Private communication, 1997

    Google Scholar 

  2. Abadi, M., Lamport, L.: An old-fashioned recipe for real time. REX workshop on real time: Theory in Practice, 1991

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  6. 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 

  7. Apt, K. Olderog, E.R.: Verification of Sequential and Concurrent Programs, Springer Verlag, 1991

    Google Scholar 

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

    Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Google Scholar 

  11. Chandy, K.M., Misra, J.: Parallel Program Design: A Foundation, Addison-Wessley, 1988

    Google Scholar 

  12. Dill, D., Clarke, E.: Automatic verification of asynchronous circuits using temporal logic. IEEE Proc. 133 (1986) 276

    Google Scholar 

  13. Francez, N.: Programm Verification, Addison-Wesley P.C., 1992

    Google Scholar 

  14. Gordon, M.: Why higher-order logic is a good formalism for specifying and verifying hardware. Formal Aspects of VLSI design, Elsevier Science Publ., pp.153–177, 1986

    Google Scholar 

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

    Google Scholar 

  16. Kahn, G.: The semantics of a simple language for parallel programming, IFIP 74

    Google Scholar 

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

    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. Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems, Springer Verlag, 1992

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  21. Mazurkiewicz, A.: Semantics of concurrent systems: A modular fixed point trace approach. In “Advances in Petri Nets”, LNCS 188, 1984

    Google Scholar 

  22. Milner, R.: Communication and Concurrency, Prentice Hall, 1989

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  28. Scott, D.: Some definitional suggestions for automata theory. J. of Computer and System Science (1967) 187–212

    Google Scholar 

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

    MATH  Google Scholar 

  30. Sontag, E.: Interconnected Automata and Linear Systems. LNCS, No. 1066 (1996) pp. 436–448

    Google Scholar 

  31. Trakhtenbrot, B.A.: Lecture notes on a course on verification of software and hardware systems, Tel Aviv University, Fall 1994

    Google Scholar 

  32. Trakhtenbrot, B.A.: Automata and hybrid systems. Lecture Notes on a course at Uppsala University, Fall 1997. See also updating Appendix 1, 1998, Tel Aviv University

    Google Scholar 

  33. Trakhtenbrot, B.A.: Compositional proofs for networks of processes. Fundamenta Informaticae 20(No. 1,2,3) (1994) 231–275

    MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Boris A. Trakhtenbrot

Authors
  1. Boris A. Trakhtenbrot
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Computer Science, “A.I.Cuza” University, 6600, Iaşi, Romania

    Gabriel Ciobanu

  2. Institute of Mathematics of the Romanian Academy, P.O. Box 1-764, 70700, Bucharest, Romania

    Gheorghe Păun

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Trakhtenbrot, B.A. (1999). Automata and their interaction: Definitional suggestions. In: Ciobanu, G., Păun, G. (eds) Fundamentals of Computation Theory. FCT 1999. Lecture Notes in Computer Science, vol 1684. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48321-7_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-48321-7_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66412-3

  • Online ISBN: 978-3-540-48321-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation