%0 Book Section %1 kuske_01_formal %A Kuske, Sabine %D 2001 %J «UML» 2001 — The Unified Modeling Language. Modeling Languages, Concepts, and Tools %K semantics statecharts graph_transformation uml 2001 %P 241--256 %R 10.1007/3-540-45441-1_19 %T A Formal Semantics of UML State Machines Based on Structured Graph Transformation %U http://dx.doi.org/10.1007/3-540-45441-1_19 %X UML state machines are quite popular and useful to specify dynamic components of software systems. They have a formal static semantics but their execution semantics is described only informally. Graph transformation, on the other hand, constitutes a well-studied area with many theoretical results and practical application domains. In this paper, an operational semantics for a subset of UML state machines is proposed which is based on graph transformation. In more detail, a UML state machine is described as a structured graph transformation system in such a way that the wellformedness rules of UML state machines are satisfied and the firing of a (maximum) set of enabled non-conflicting transitions corresponds to the application of a graph transformation rule. The presented approach uses the concept of transformation units, a recently developed modularization concept for graph transformation systems.

@incollection{kuske_01_formal, abstract = {UML state machines are quite popular and useful to specify dynamic components of software systems. They have a formal static semantics but their execution semantics is described only informally. Graph transformation, on the other hand, constitutes a well-studied area with many theoretical results and practical application domains. In this paper, an operational semantics for a subset of UML state machines is proposed which is based on graph transformation. In more detail, a UML state machine is described as a structured graph transformation system in such a way that the wellformedness rules of UML state machines are satisfied and the firing of a (maximum) set of enabled non-conflicting transitions corresponds to the application of a graph transformation rule. The presented approach uses the concept of transformation units, a recently developed modularization concept for graph transformation systems.}, added-at = {2009-02-12T11:38:47.000+0100}, author = {Kuske, Sabine}, biburl = {https://www.bibsonomy.org/bibtex/2fe72d6b826a5daeff597b7595906a968/leonardo}, citeulike-article-id = {2505229}, doi = {10.1007/3-540-45441-1_19}, interhash = {1c7c5095be0afe374126e049b749840a}, intrahash = {fe72d6b826a5daeff597b7595906a968}, journal = {«UML» 2001 — The Unified Modeling Language. Modeling Languages, Concepts, and Tools}, keywords = {semantics statecharts graph_transformation uml 2001}, pages = {241--256}, posted-at = {2008-03-11 01:40:57}, priority = {5}, timestamp = {2009-02-12T11:38:47.000+0100}, title = {A Formal Semantics of UML State Machines Based on Structured Graph Transformation}, url = {http://dx.doi.org/10.1007/3-540-45441-1_19}, year = 2001 }