From UML 2 Sequence Diagrams to State Machines by Graph Transformation.

  • Grønmo R
  • Møller-Pedersen B
N/ACitations
Citations of this article
14Readers
Mendeley users who have this article in their library.

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 specifica-tion of the transformation rules is based on the concrete syntax of sequence diagrams and state machines. We introduce tailored transformation sup-port for sequence diagrams and a novel graphical operator to match and transform combined fragments.

Cite

CITATION STYLE

APA

Grønmo, R., & Møller-Pedersen, B. (2011). From UML 2 Sequence Diagrams to State Machines by Graph Transformation. The Journal of Object Technology, 10, 8:1. https://doi.org/10.5381/jot.2011.10.1.a8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free