Abstract
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 transformation rules are 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. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Grønmo, R., & Møller-Pedersen, B. (2010). From sequence diagrams to state machines by graph transformation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6142 LNCS, pp. 93–107). https://doi.org/10.1007/978-3-642-13688-7_7
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
