Equivalences of Statecharts

  • Andrea Maggiolo-Schettini
  • Adriano Peron
  • Simone Tini
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1119)


We present a new semantics of Statecharts that excludes failures and a compositional formulation of this semantics based on Labelled Transition Systems (LTS). We consider a hierarchy of LTS equivalences and we study their congruence properties w.r. to statechart operators.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    von der Beeck, M.: A Comparison of Statecharts Variants, Lecture Notes in Computer Science 863, Springer, Berlin, 1994, pp. 128–148.Google Scholar
  2. 2.
    Berry, G., Gonthier, G.: The ESTEREL Synchronous Programming Language: Design, Semantics, Implementation, Science of Computer Programming 19 (1992), pp. 87–152.Google Scholar
  3. 3.
    De Nicola, R.: Extensional Equivalences for Transition Systems, Acta Informatica 24 (1987), pp. 211–237.Google Scholar
  4. 4.
    Harel, D.: Statecharts: A Visual Formalism for Complex Systems, Science of Computer Programming 8 (1987), pp. 231–274.Google Scholar
  5. 5.
    Huizing, C., Gerth, R., de Roever, W. P.: Modelling Statecharts Behaviour in a Fully Abstract Way, Lecture Notes in Computer Science 299, Springer, Berlin, 1988, pp. 271–294.Google Scholar
  6. 6.
    Maraninchi, F.: Operational and Compositional Semantics of Synchronous Automaton Composition, Lecture Notes in Computer Science 630, Springer, Berlin, 1992, pp. 550–564.Google Scholar
  7. 7.
    Harel, D., Pnueli, A., Schmidt, J., P. Sherman, R.: On the Formal Semantics of Statecharts, Proc. 2nd IEEE Symposium on Logic in Computer Science, IEEE CS Press, New York, 1987, pp. 54–64.Google Scholar
  8. 8.
    Pnueli, A., Shalev, M.: What is a Step: On the Semantics of Statecharts, Lecture Notes in Computer Science 525, Springer, Berlin, 1991, pp. 244–464.Google Scholar
  9. 9.
    Uselton, A.C., Smolka, S.A.: A Compositional Semantics for Statecharts using Labeled Transition System, Lecture Notes in Computer Science 836, Springer, Berlin, 1994, pp. 2–17.Google Scholar
  10. 10.
    Uselton, A.C., Smolka, S.A.: A Process Algebraic Semantics for Statecharts via State Refinement, Proceedings of IFIP Working Conference on Programming Concepts, Methods and Calculi, 1994, pp. 267–286.Google Scholar

Copyright information

© Springer-Verlag 1996

Authors and Affiliations

  • Andrea Maggiolo-Schettini
    • 1
  • Adriano Peron
    • 2
  • Simone Tini
    • 1
  1. 1.Dipartimento di InformaticaUniversità di PisaPisaItaly
  2. 2.Dipartimento di Matematica e InformaticaUniversità di UdineUdineItaly

Personalised recommendations