Statecharts via Process Algebra | Zendy

Gerald Lüttgen | Zendy; Michael von der Beeck | Zendy; Rance Cleaveland | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Statecharts via Process Algebra

Author(s) -

Gerald Lüttgen,

Michael von der Beeck,

Rance Cleaveland

Publication year - 1999

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-66425-4

DOI - 10.1007/3-540-48320-9_28

Subject(s) - computer science , bisimulation , process calculus , programming language , concurrency , operational semantics , notation , semantics (computer science) , equivalence (formal languages) , finite state machine , theoretical computer science , communicating sequential processes , mathematics , arithmetic , discrete mathematics

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, we present a simple process algebra, called Statecharts Process Language (SPL), which is expressive enough for encoding Statecharts in a structure-preserving and semantics-preserving manner. We also establish that the behavioral equivalence bisimulation, when applied to SPL, preserves Statecharts semantics.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research