Please use this identifier to cite or link to this item:
For citation please use:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorEhrig, Hartmut-
dc.contributor.authorErmel, Claudia-
dc.contributor.authorHermann, Frank-
dc.description.abstractTriple graph grammars have been applied and implemented as a formal basis for model transformations in a variety of application areas. They convince by special abilities in automatic derivation of forward, backward and several other transformations out of just one specified set of rules for the integrated model defined by a triple of graphs. While many case studies and all implementations, which state that they are using triple graph grammars, do not use triples of graphs, this paper presents the justification for many of them. It shows a one to one correspondence between triple graph grammars and suitable plain graph grammars, thus results and benefits of the triple case can be transferred to the plain case. Main results show the relationship between both graph transformation approaches, syntactical correctness of model transformations based on triple graph grammars and a sound and complete condition for functional behaviour. Theoretical results are elaborated on an intuitive case study for a model transformation from class diagrams to database models.en
dc.subject.ddc004 Datenverarbeitung; Informatik-
dc.subject.othermodel transformationen
dc.subject.othergraph transformationen
dc.subject.othertriple graph transformationen
dc.titleOn the Relationship of Model Transformations Based on Triple and Plain Graph Grammars (Long Version)en
dc.typeResearch Paper-
tub.publisher.universityorinstitutionTechnische Universität Berlin-
tub.series.nameForschungsberichte der Fakultät IV - Elektrotechnik und Informatik / Technische Universität Berlin-
Appears in Collections:Fak. 4 Elektrotechnik und Informatik » Publications

Files in This Item:
Format: Adobe PDF | Size: 469.66 kB
DownloadShow Preview

Item Export Bar

Items in DepositOnce are protected by copyright, with all rights reserved, unless otherwise indicated.