From UML 2 Sequence Diagrams to State Machines by Graph Transformation

By: Roy Grønmo, Birger Møller-Pedersen


Algebraic graph transformation has been promoted by several authors as a means to specify model transformations. This paper explores how we can specify graph transformation-based rules for a classical problem of transforming from sequence diagrams to state machines. The specification of the transformation rules is based on the concrete syntax of sequence diagrams and state machines. We introduce tailored transformation support for sequence diagrams and a novel graphical operator to match and transform combined fragments.


Graph transformation; Model transformation; UML; sequence diagram; state machine

Cite as:

Roy Grønmo, Birger Møller-Pedersen, “From UML 2 Sequence Diagrams to State Machines by Graph Transformation”, Journal of Object Technology, Volume 10, (2011), pp. 8:1-22, doi:10.5381/jot.2011.10.1.a8.

PDF | DOI | BiBTeX | Tweet this | Post to CiteULike | Share on LinkedIn

The JOT Journal   |   ISSN 1660-1769   |   DOI 10.5381/jot   |   AITO   |   Open Access   |    Contact