TU Darmstadt / ULB / TUbiblio

Bidirectional Model Transformation with Precedence Triple Graph Grammars

Lauder, Marius ; Anjorin, Anthony ; Varró, Gergely ; Schürr, Andy
Fachgebiet Echtzeitsysteme (Real-Time Systems Lab), TU Darmstadt (eds.) :

Bidirectional Model Transformation with Precedence Triple Graph Grammars.
[Online-Edition: urn:nbn:de:tuda-tuprints-29162]
Fachgebiet Echtzeitsysteme (Real-Time Systems Lab), TU Darmstadt (s.) tuprints , Darmstadt
[Report] , (2012)

Offizielle URL: urn:nbn:de:tuda-tuprints-29162

Kurzbeschreibung (Abstract)

Triple Graph Grammars (TGGs) are a rule-based technique with a formal background for specifying bidirectional model transformation. In practical scenarios, the unidirectional rules needed for the forward and backward transformations are automatically derived from the TGG rules in the specification, and the overall transformation process is governed by a control algorithm. Current implementations either have a worst case exponential runtime complexity or pose such strong restrictions on the class of supported TGGs that practical real-world applications become infeasible. This paper, therefore, introduces a new class of TGGs together with a control algorithm that drops a number of practice-relevant restrictions for TGG rules and still has a polynomial runtime complexity.

Typ des Eintrags: Report
Erschienen: 2012
Autor(en): Lauder, Marius ; Anjorin, Anthony ; Varró, Gergely ; Schürr, Andy
Titel: Bidirectional Model Transformation with Precedence Triple Graph Grammars
Sprache: Englisch
Kurzbeschreibung (Abstract):

Triple Graph Grammars (TGGs) are a rule-based technique with a formal background for specifying bidirectional model transformation. In practical scenarios, the unidirectional rules needed for the forward and backward transformations are automatically derived from the TGG rules in the specification, and the overall transformation process is governed by a control algorithm. Current implementations either have a worst case exponential runtime complexity or pose such strong restrictions on the class of supported TGGs that practical real-world applications become infeasible. This paper, therefore, introduces a new class of TGGs together with a control algorithm that drops a number of practice-relevant restrictions for TGG rules and still has a polynomial runtime complexity.

Ort: Darmstadt
Verlag: tuprints
Freie Schlagworte: triple graph grammars, control algorithm of unidirectional transformations, node precedence analysis, rule dependency analysis
Fachbereich(e)/-gebiet(e): 18 Fachbereich Elektrotechnik und Informationstechnik
18 Fachbereich Elektrotechnik und Informationstechnik > Institut für Datentechnik > Echtzeitsysteme
18 Fachbereich Elektrotechnik und Informationstechnik > Institut für Datentechnik
Exzellenzinitiative
Exzellenzinitiative > Graduiertenschulen
Exzellenzinitiative > Graduiertenschulen > Graduate School of Computational Engineering (CE)
Zentrale Einrichtungen
Hinterlegungsdatum: 21 Mär 2012 14:21
Offizielle URL: urn:nbn:de:tuda-tuprints-29162
ID-Nummer: urn:nbn:de:tuda-tuprints-29162
Verwandte URLs:
Schlagworte in weiteren Sprachen:
Einzelne SchlagworteSprache
triple graph grammars, control algorithm of unidirectional transformations, node precedence analysis, rule dependency analysisEnglisch
Export:

Optionen (nur für Redakteure)

Eintrag anzeigen Eintrag anzeigen