Abstract
The language of state charts is precisely defined. A formal syntactical definition is given that defines all legal state charts, together with an operational semantics that reflects the automata theoretic view consistently. Finally, an efficient interpreter to enable prototyping with state charts is specified.
This work has partially been supported by the Netherlands Organization for Scientific Research (NWO) by grant B62-386
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Jürgen Ebert. A Versatile Data Structure for Edge-Oriented Graph Algorithms. Communications ACM 30 (1987,6), 513–519.
Jürgen Ebert. Efficient Interpretation of State Charts (Long Version). Rijksuniversiteit te Leiden, the Netherlands, Vakgroep Informatica, Report 93-xx.
D. Harel, A. Pnueli, J.P. Schmidt, R. Sherman On the Formal Semantics of Statecharts. Science of Computer Programming 8 (1987,3), 231–214
David Harel. Statecharts: a visual formalism for complex systems. Science of Computer Programming 8 (1987,3), 231–214
David Harel. On visual formalisms. Communications of the ACM 31 (1988, 5), 514–530
John E. Hopcroft, Jeffrey D. Ullman. Introduction to Automata Theory, Languages, and Computation. Reading MA: Addison-Wesley, 1979.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ebert, J. (1993). Efficient interpretation of state charts. In: Ésik, Z. (eds) Fundamentals of Computation Theory. FCT 1993. Lecture Notes in Computer Science, vol 710. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57163-9_17
Download citation
DOI: https://doi.org/10.1007/3-540-57163-9_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57163-6
Online ISBN: 978-3-540-47923-9
eBook Packages: Springer Book Archive