Translating Erlang State Machines to UML Using Triple Graph Grammars

Authors

  • D. Lukacs Faculty of Informatics, Eötvös Loránd University, Budapest, Hungary
  • M. Toth Faculty of Informatics, Eötvös Loránd University, Budapest, Hungary

DOI:

https://doi.org/10.24193/subbi.2018.1.03

Abstract

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.

Downloads

Published

2018-06-19

Issue

Section

Articles