Orejas, FernandoGuerra, Estherde Lara, JuanEhrig, Hartmut2020-06-152020-06-1520091436-9915https://depositonce.tu-berlin.de/handle/11303/11372http://dx.doi.org/10.14279/depositonce-10259Model-to-model (M2M) transformation consists in transforming models from a source to a target language. Many transformation languages exist, but few of them combine a declarative and relational style with a formal underpinning able to show properties of the transformation. Pattern-based transformation is an algebraic, bidirectional, and relational approach to M2M transformation. Specifications are made of patterns stating the allowed or forbidden relations between source and target models, and then compiled into low level operational mechanisms to perform source-to-target or target-to-source transformations. In this paper, we study the compilation into operational triple graph grammar rules and show: (i) correctness of the compilation of a specification without negative patterns; (ii) termination of the rules, and (iii) completeness, in the sense that every model considered relevant can be built by the rules.en004 Datenverarbeitung; Informatikmodel transformationtarget modelgraph transformationgraph grammarnegative patternResearch Paper