Lauder, Marius ; Anjorin, Anthony ; Varró, Gergely ; Schürr, Andy
Hrsg.: Fachgebiet Echtzeitsysteme (Real-Time Systems Lab), Technische Universität Darmstadt (2012)
Bidirectional Model Transformation with Precedence Triple Graph Grammars.
Report, Erstveröffentlichung
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 | ||||
| Art des Eintrags: | Erstveröffentlichung | ||||
| Titel: | Bidirectional Model Transformation with Precedence Triple Graph Grammars | ||||
| Sprache: | Englisch | ||||
| Publikationsjahr: | 1 März 2012 | ||||
| Ort: | Darmstadt | ||||
| URL / URN: | urn:nbn:de:tuda-tuprints-29162 | ||||
| Zugehörige Links: | |||||
| 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. |
||||
| Freie Schlagworte: | triple graph grammars, control algorithm of unidirectional transformations, node precedence analysis, rule dependency analysis | ||||
| Schlagworte: |
|
||||
| Sachgruppe der Dewey Dezimalklassifikatin (DDC): | 000 Allgemeines, Informatik, Informationswissenschaft > 004 Informatik | ||||
| 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 | ||||
| Letzte Änderung: | 05 Jan 2024 10:44 | ||||
| PPN: | |||||
| Schlagworte: |
|
||||
| Export: | |||||
| Suche nach Titel in: | TUfind oder in Google | ||||
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum