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 semanticspreserving manner. We also establish that the behavioral equivalence bisimulation, when applied to SPL, preserves Statecharts semantics.
%0 Book Section
%1 luttgen_99_statecharts
%A Lüttgen, Gerald
%A von der Beeck, Michael
%A Cleaveland, Rance
%D 1999
%J CONCUR^a€™99 Concurrency Theory
%K _hardcopy equivalence semantics statecharts _folder_3 1999
%P 782
%R 10.1007/3-540-48320-9_28
%T Statecharts via Process Algebra
%U http://dx.doi.org/10.1007/3-540-48320-9_28
%X 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 semanticspreserving manner. We also establish that the behavioral equivalence bisimulation, when applied to SPL, preserves Statecharts semantics.
@incollection{luttgen_99_statecharts,
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, 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.},
added-at = {2009-02-12T11:38:54.000+0100},
author = {L"{u}ttgen, Gerald and von der Beeck, Michael and Cleaveland, Rance},
biburl = {https://www.bibsonomy.org/bibtex/2cebc0587522e28d3edc4908cd4d7e1fb/leonardo},
citeulike-article-id = {2468513},
doi = {10.1007/3-540-48320-9_28},
interhash = {b05c028a07c745fa6cd188b418a063df},
intrahash = {cebc0587522e28d3edc4908cd4d7e1fb},
journal = {CONCUR^{a}€™99 Concurrency Theory},
keywords = {_hardcopy equivalence semantics statecharts _folder_3 1999},
pages = 782,
posted-at = {2008-03-05 01:26:25},
priority = {3},
timestamp = {2009-02-12T11:38:54.000+0100},
title = {Statecharts via Process Algebra},
url = {http://dx.doi.org/10.1007/3-540-48320-9_28},
year = 1999
}