Statecharts Via Process Algebra

Statecharts is a visual language for specifying the behavior of reactive systems. The language extends nite-state machines with concepts of hierarchy, concurrency, and priority. Despite its popularity as a design notation for embedded systems, precisely de ning its semantics has proved extremely challenging. In this paper, we present a simple process algebra, called Statecharts Process Language (SPL), which is expressive enough for encoding Statecharts in a structure-preserving and semanticspreserving manner. We also establish that the behavioral equivalence bisimulation, when applied to SPL, preserves Statecharts semantics.

• Type: Conference
• Year: 1999
• Where: CONCUR
• Authors: Gerald Lüttgen, Michael von der Beeck, Rance Cleaveland
• Keywords: Behavioral Equivalence Bisimulation, CONCUR 1999, Distributed And Parallel Computing, Statecharts Process Language, Statecharts Semantics