Skip to main content

Equivalences of Statecharts

  • Conference paper
  • First Online:
CONCUR '96: Concurrency Theory (CONCUR 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1119))

Included in the following conference series:

Abstract

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.

Research partially supported by Esprit BRA 8130 LOMAPS.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. Berry, G., Gonthier, G.: The ESTEREL Synchronous Programming Language: Design, Semantics, Implementation, Science of Computer Programming 19 (1992), pp. 87–152.

    Google Scholar 

  3. De Nicola, R.: Extensional Equivalences for Transition Systems, Acta Informatica 24 (1987), pp. 211–237.

    Google Scholar 

  4. Harel, D.: Statecharts: A Visual Formalism for Complex Systems, Science of Computer Programming 8 (1987), pp. 231–274.

    Google Scholar 

  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. 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. 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. 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. 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. 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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Ugo Montanari Vladimiro Sassone

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Maggiolo-Schettini, A., Peron, A., Tini, S. (1996). Equivalences of Statecharts. In: Montanari, U., Sassone, V. (eds) CONCUR '96: Concurrency Theory. CONCUR 1996. Lecture Notes in Computer Science, vol 1119. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61604-7_84

Download citation

  • DOI: https://doi.org/10.1007/3-540-61604-7_84

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61604-7

  • Online ISBN: 978-3-540-70625-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics