Chapter

CONCUR '96: Concurrency Theory

Volume 1119 of the series Lecture Notes in Computer Science pp 687-702

Date:

Equivalences of Statecharts

  • Andrea Maggiolo-SchettiniAffiliated withDipartimento di Informatica, Università di Pisa
  • , Adriano PeronAffiliated withDipartimento di Matematica e Informatica, Università di Udine
  • , Simone TiniAffiliated withDipartimento di Informatica, Università di Pisa

* Final gross prices may vary according to local VAT.

Get Access

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.