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,
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abramsky, S.: Private communication, 1997
Abadi, M., Lamport, L.: An old-fashioned recipe for real time. REX workshop on real time: Theory in Practice, 1991
Alur, R., Dill, D.: Automata for modelling real-time systems. Proceedings of ICALP90, LNCS 443 (1990) pp. 332–335
Alur, R., Fix, L., Henzinger, T.: A deterministic class of timed automata. Proc. CAV’94, LNCS 818, pp. 1–13
Alur, R., Henzinger, T.: Logics and models for real time: theory in practice. LNCS 600 (1992) pp. 74–106
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
Apt, K. Olderog, E.R.: Verification of Sequential and Concurrent Programs, Springer Verlag, 1991
Artstein, Z.: Examples of stabilization with hybrid feedback. LNCS 1066 (1996) pp. 173–185
Broy, M.: Semantics of finite and infinite networks of concurrent communicating agents. Distributed Computing 2 (1987) 13–31
Burks, A.W., Wright, J.B.: Theory of logical nets. Proceedings of the I.R.E., 1953
Chandy, K.M., Misra, J.: Parallel Program Design: A Foundation, Addison-Wessley, 1988
Dill, D., Clarke, E.: Automatic verification of asynchronous circuits using temporal logic. IEEE Proc. 133 (1986) 276
Francez, N.: Programm Verification, Addison-Wesley P.C., 1992
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
Henzinger, T.: The theory of hybrid automata. Proceedings of the IEEE (1996) 278–292
Kahn, G.: The semantics of a simple language for parallel programming, IFIP 74
Kobrinsky, N.., Trakhtenbrot, B.A.: Introduction to the Theory of Finite Automata (Russian edition, 1962), Transl. North Holland, 1965
Maler, O., Pnueli, A.: Timing analysis of asynchronous circuits using timed automata. Proceedings CHARME’95, LNCS 987, pp. 189–205
Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems, Springer Verlag, 1992
Manna, Z., Pnueli, A.: Models for reactivity. Acta Informatica 30 (1993) 609–678.
Mazurkiewicz, A.: Semantics of concurrent systems: A modular fixed point trace approach. In “Advances in Petri Nets”, LNCS 188, 1984
Milner, R.: Communication and Concurrency, Prentice Hall, 1989
Olderog, E.R., Dierks, H.: Decomposing real-time specifications. Intern. Symp. COMPOS’97. LNCS 1536, pp. 465–489
Pardo, D.: Timed Automata: Transducers and Circuits, M.Sc. Thesis, Tel-Aviv Univ., 1997
Pardo, D., Rabinovich, A., Trakhtenbrot, B.A.: On synchronous circuits over continuous time, Technical Report, Tel Aviv University, 1997
Rabinovich, A.: Finite automata over continuous time, Technical Report, Tel Aviv University, 1996
Rabinovich, A., Trakhtenbrot, B.: From finite automata toward hybrid systems. Proceedings FCT’97, LNCS
Scott, D.: Some definitional suggestions for automata theory. J. of Computer and System Science (1967) 187–212
Sontag, E.: Mathematical Control Theory: Deterministic Finite Dimensional Systems, Springer, N.Y., 1990
Sontag, E.: Interconnected Automata and Linear Systems. LNCS, No. 1066 (1996) pp. 436–448
Trakhtenbrot, B.A.: Lecture notes on a course on verification of software and hardware systems, Tel Aviv University, Fall 1994
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
Trakhtenbrot, B.A.: Compositional proofs for networks of processes. Fundamenta Informaticae 20(No. 1,2,3) (1994) 231–275
Trakhtenbrot, B.A.: Origins and metamorphose of the trinity: Logics, nets, automata, Proceedings, LICS’95
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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