Statecharts via process algebra

  • Authors:
  • Gerald Luettgen;Michael Beeck;Rance Cleaveland

  • Affiliations:
  • -;-;-

  • Venue:
  • Statecharts via process algebra
  • Year:
  • 1999

Quantified Score

Hi-index 0.01

Visualization

Abstract

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