A comparison of Statecharts variants

  • Michael von der Beeck
Conference paper
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 863)

Abstract

The Statecharts formalism supports the development of intuitive graphical specifications for reactive systems. Nevertheless, some serious problems became apparent in the original Statecharts formalism so that many different Statecharts variants were proposed to overcome them. These problems are thoroughly described and approaches for solving them are evaluated. Furthermore, a set of distinctive features is elaborated which is used for a detailed comparison of the Statecharts variants. Finally, the feature set is used to characterize a new hypothetical Statecharts variant.

Keywords

Instantaneous State Problem List Denotational Semantic Transition Execution Compositional Semantic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    M. von der Beeck: Integration of Structured Analysis and Timed Statecharts for Real-Time and Concurrency Specification, Proc. of ESEC '93, LNCS, vol. 717, Springer, pp. 313–328, 1993Google Scholar
  2. 2.
    A. Benveniste, G. Berry: The Synchronous Approach to Reactive and Real-Time Systems, Proc. of the IEEE, vol. 79, no. 9, pp. 1270–1282, 1991Google Scholar
  3. 3.
    G. Berry: Preemption in Concurrent Systems, Proc. of FSTTCS 93, LNCS, vol. 761, Springer, pp. 72–93, 1993Google Scholar
  4. 4.
    G. Berry, G. Gonthier: The ESTEREL synchronous programming language: design, semantics, implementation, Science of Computer Programming, vol. 19, pp. 87–152, 1992Google Scholar
  5. 5.
    G. Berry, S. Ramesh, R. Shyamasundar: Communicating Reactive Processes, Proc. of ACM Symp. on Principles of Programming Languages, Charleston, 1993Google Scholar
  6. 6.
    A. Classen: Modulare Statecharts: Ein formaler Rahmen zur hierarchischen ProzeΒspezifikation, Master Thesis, (in German), Lehrstuhl für Informatik II, Aachen University of Technology, Germany, 1993Google Scholar
  7. 7.
    N. Day: A Model Checker for Statecharts (Linking CASE tools with Formal Methods), Technical Report 93-35, University of British Columbia, Vancouver, Canada, 1993Google Scholar
  8. 8.
    D. Harel: Statecharts: A visual formalism for complex systems, Science of Computer Programming, vol. 8, pp. 231–274, 1987Google Scholar
  9. 9.
    D. Harel, A. Pnueli: On the development of reactive systems, in: Logics and Models of Concurrent Systems, NATO ASI Series, vol. 13, ed. K. Apt, Springer, pp. 477–498, 1985Google Scholar
  10. 10.
    D. Harel, A. Pnueli, J. Schmidt, R. Sherman: On the Formal Semantics of Statecharts, Proc. of 2nd IEEE Symp. on Logic in Computer Science, Ithaca, NY, pp. 54–64, 1987Google Scholar
  11. 11.
    C. Hoare: Communicating Sequential Processes, Prentice Hall, 1987Google Scholar
  12. 12.
    J. Hooman, S. Ramesh, W. de Roever: A compositional axiomatization of Statecharts, Theoretical Computer Science, vol. 101, no. 2, Elsevier, pp. 289–335, 1992Google Scholar
  13. 13.
    C. Huizing: Semantics of Reactive Systems: Comparison and Full Abstraction, Ph.D. thesis, Technical University Eindhoven, The Netherlands, 1991Google Scholar
  14. 14.
    C. Huizing, R. Gerth: Semantics of Reactive Systems in Abstract Time, LNCS, vol. 600, Springer, pp. 291–314, 1992Google Scholar
  15. 15.
    C. Huizing, R. Gerth, W. P. de Roever: Modelling Statecharts behaviour in a fully abstract way, LNCS, vol. 299, Springer, pp. 271–294, 1988Google Scholar
  16. 16.
    Y. Kesten, A. Pnueli: Timed and Hybrid Statecharts and their Textual Representation, LNCS, vol. 571, Springer, pp. 591–620, 1992Google Scholar
  17. 17.
    N. Leveson, M. Heimdahl, H. Hildreth, J. Reese: Requirements Specification for Process-Control Systems, Technical Report 92-106, University of California, USA, 1992Google Scholar
  18. 18.
    A. Maggioli-Schettini, A. Peron: Semantics of Full Statecharts Based on Graph Rewriting, Dipartimento di Informatica, Universita di Pisa, Italy, 1993Google Scholar
  19. 19.
    F. Maraninchi: Argos: a Graphical Synchronous Language for the Description of Reactive Systems, RT-C29, LGI-IMAG Grenoble, France, 1991Google Scholar
  20. 20.
    F. Maraninchi: Operational and Compositional Semantics of Synchronous Automaton Compositions, LNCS, vol. 630, CONCUR '92, Springer, pp. 550–564, 1992Google Scholar
  21. 21.
    F. Maraninchi: Languages for reactive systems: a common framework for comparing Statecharts and Argos, Technical Report, Spectre Report C34, LGI-IMAG, Grenoble, France, 1992Google Scholar
  22. 22.
    A. Peron: Synchronous and Asynchronous Models for Statecharts, Technical Report TD-21/93, Dipartimento di Informatica, Universita di Pisa, Italy, 1993Google Scholar
  23. 23.
    A. Pnueli, M. Shalev: What is in a Step: On the Semantics of Statecharts, LNCS, vol. 526, Springer, pp. 244–264, 1991Google Scholar
  24. 24.
    D. Scott, C. Strachey: Towards a Mathematical Semantics for Computer Languages, Proc. of Symposium on Computers and Automata, (ed. J. Fox), Polytechnic Institute of Brooklyn Press, New York, USA, pp. 19–46, 1971Google Scholar
  25. 25.
    B. Steffen: Hierarchische Spezifikationen, GI/ITG-FachgesprÄch für Verteilte Systeme, Kiel, 1994Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Michael von der Beeck
    • 1
  1. 1.Lehrstuhl für Informatik IIIAachen University of TechnologyAachenGermany

Personalised recommendations