Advertisement

Efficient interpretation of state charts

  • Jürgen Ebert
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 710)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Jürgen Ebert. A Versatile Data Structure for Edge-Oriented Graph Algorithms. Communications ACM 30 (1987,6), 513–519.CrossRefGoogle Scholar
  2. [2]
    Jürgen Ebert. Efficient Interpretation of State Charts (Long Version). Rijksuniversiteit te Leiden, the Netherlands, Vakgroep Informatica, Report 93-xx.Google Scholar
  3. [3]
    D. Harel, A. Pnueli, J.P. Schmidt, R. Sherman On the Formal Semantics of Statecharts. Science of Computer Programming 8 (1987,3), 231–214CrossRefGoogle Scholar
  4. [4]
    David Harel. Statecharts: a visual formalism for complex systems. Science of Computer Programming 8 (1987,3), 231–214CrossRefGoogle Scholar
  5. [5]
    David Harel. On visual formalisms. Communications of the ACM 31 (1988, 5), 514–530CrossRefGoogle Scholar
  6. [6]
    John E. Hopcroft, Jeffrey D. Ullman. Introduction to Automata Theory, Languages, and Computation. Reading MA: Addison-Wesley, 1979.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Jürgen Ebert
    • 1
  1. 1.Institut für InformatikUniversität KoblenzGermany

Personalised recommendations