Equivalences of Statecharts

  • Andrea Maggiolo-Schettini
  • Adriano Peron
  • Simone Tini
Conference paper

DOI: 10.1007/3-540-61604-7_84

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1119)
Cite this paper as:
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

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