Translating Erlang State Machines to UML Using Triple Graph Grammars

In this paper, we present a method that transforms event driven Erlang state machines into high-level state machine models represented in UML. We formalized the transformation system as a triple graph grammar, a special case of graph rewriting. We argue in this paper that using this well-defined for...

Full description

Saved in:
Bibliographic Details
Published inStudia Universitatis Babes-Bolyai: Series Informatica Vol. 63; no. 1; pp. 33 - 50
Main Authors Lukacs, D., Toth, M.
Format Journal Article
LanguageEnglish
Published Babes-Bolyai University, Cluj-Napoca 25.06.2018
Subjects
Erlang, triple graph grammar, UML, CASE, state machine, model transformation
Online AccessGet full text

Cover

More Information
Summary:In this paper, we present a method that transforms event driven Erlang state machines into high-level state machine models represented in UML. We formalized the transformation system as a triple graph grammar, a special case of graph rewriting. We argue in this paper that using this well-defined formal procedure opens up the way for verifying the transformation system, synchronizing code and formal documentation, and executing state machine models among many other possible use cases. We also provide an example transformation system and demonstrate its application in action on a small Erlang state machine. We also present our evaluation of our full system implementation tested on real world Erlang state machines.
ISSN:1224-869X
2065-9601
DOI:10.24193/subbi.2018.1.03