TU Darmstadt / ULB / TUbiblio

Bidirectional Model Transformation with Precedence Triple Graph Grammars

Lauder, Marius and Anjorin, Anthony and Varró, Gergely and 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)

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

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.

Item Type: Report
Erschienen: 2012
Creators: Lauder, Marius and Anjorin, Anthony and Varró, Gergely and Schürr, Andy
Title: Bidirectional Model Transformation with Precedence Triple Graph Grammars
Language: English
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.

Place of Publication: Darmstadt
Publisher: tuprints
Uncontrolled Keywords: triple graph grammars, control algorithm of unidirectional transformations, node precedence analysis, rule dependency analysis
Divisions: 18 Department of Electrical Engineering and Information Technology
18 Department of Electrical Engineering and Information Technology > Institute of Computer Engineering > Real-Time Systems
18 Department of Electrical Engineering and Information Technology > Institute of Computer Engineering
Exzellenzinitiative
Exzellenzinitiative > Graduate Schools
Exzellenzinitiative > Graduate Schools > Graduate School of Computational Engineering (CE)
Zentrale Einrichtungen
Date Deposited: 21 Mar 2012 14:21
Official URL: urn:nbn:de:tuda-tuprints-29162
Identification Number: urn:nbn:de:tuda-tuprints-29162
Related URLs:
Alternative keywords:
Alternative keywordsLanguage
triple graph grammars, control algorithm of unidirectional transformations, node precedence analysis, rule dependency analysisEnglish
Export:

Optionen (nur für Redakteure)

View Item View Item