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.
Preview
Unable to display preview. Download preview PDF.
References
M. Abadi and L. Lamport. An Old-Fashioned Recipe for Real Time. In ACM Toplas 16, 5:1543–1571,1994.
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.
R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126:183–235,1994.
R. Alur, T. Henzinger and P. Ho. Automatic Symbolic Verification of Embedded Systems, 1993.
T. Henzinger. A theory of hybrid automata. In Proceedings of LICS, 1996.
N. Kobrinski and B. A. Trakhtenbrot. Introduction to the theory of Finite Automata, North Holland 1965.
S. Kleene. Representation of events in nerve nets and finite automata. Automata Studies, 32-41, Princeton, 1956.
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.
R. McCulloch and W. Pitts. A logical calculus of the ideas immanent inn nervous activity. Bull., Math. Biophysics, 5, 1943, pp. 115–133.
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.
B. Trakhtenbrot. Origins and Metamorphoses of the Trinity: Logics, Nets, Automata. In Proceedings of LICS, 1995.
D. Scott. Some definitional suggestions for automata theory. J. of Computer and System Science, 1967, pp.187–212.
T. Wilke. Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata, FTFRFT, 1994. *** DIRECT SUPPORT *** A0008123 00011
Author information
Authors and Affiliations
Editor information
Rights 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