TGGs for Transforming UML to CSP: Contribution to the AGTIVE 2007 Graph Transformation Tools Contest

Joel Greenyer, Ekkart Kindler, Jan Rieke, Oleg Travkin

    Research output: Book/ReportReportResearch


    Along with the AGTIVE 2007 conference, a Graph Transformation Tools Contenst invited tool implementers to present their solutions in order to compare the principles and particular strengths and weaknesses of today's graph transformation tools. This paper documents our contribution to the Tools Contest. The second transformation problem, a transformation from UML activity diagrams to CSP processes, i.e. a transformation between two models, is a typical application for Triple Graph Grammars (TGGs). We present our contributed solution, presenting the TGG rules and the implementation of our TGG interpreter. Moreover, we point out the advantages of our soulution as well as some restrictions of the current implementation. This paper will only briefly state the transformation problem and focus on our TGG approach and the discussion of the rules.
    Original languageEnglish
    Place of PublicationPaderborn, Germany
    PublisherDepartment of Computer Science, University of Paderborn
    Number of pages24
    Publication statusPublished - 2008
    SeriesReihe Informatik

    Cite this