A. Schürr, and F. Klar. Graph Transformations, 4th International Conference, ICGT 2008, Leicester, United Kingdom, September 7-13, 2008. Proceedings, volume 5214 of Lecture Notes in Computer Science, page 411--425. (2008)
Abstract
Triple graph grammars (TGGs) have been invented 15 years ago as a formalism for the declarative specification of bidirectional
graph-to-graph translations. In this paper we present a list of still open problems concerning the interpretation and theexpressiveness of TGGs. We will comment on extensions proposed to improve the original approach and the drawbacks that arisethereof. Consequently a more precise formalization of compulsory properties of the translation of triple graph grammars intoforward and backward graph translation functions is given. Regarding these properties an interpretation and implementationof negative application conditions is derived that does not destroy the benefits of the original approach. Additionally anew demand-driven forward/backward translation rule application strategy is proposed. It guarantees for the first time automaticallya correct ordering of rule applications without imposing any additional requirements on the structure of the regarded graphs.
%0 Conference Paper
%1 schuerr-klar:08
%A Schürr, Andy
%A Klar, Felix
%B Graph Transformations, 4th International Conference, ICGT 2008, Leicester, United Kingdom, September 7-13, 2008. Proceedings
%D 2008
%E Ehrig, Hartmut
%E Heckel, Reiko
%E Rozenberg, Grzegorz
%E Taentzer, Gabriele
%K 2008 GraGra TripleGraphGrammars tgg
%P 411--425
%T 15 Years of Triple Graph Grammars
%U http://dx.doi.org/10.1007/978-3-540-87405-8_28
%V 5214
%X Triple graph grammars (TGGs) have been invented 15 years ago as a formalism for the declarative specification of bidirectional
graph-to-graph translations. In this paper we present a list of still open problems concerning the interpretation and theexpressiveness of TGGs. We will comment on extensions proposed to improve the original approach and the drawbacks that arisethereof. Consequently a more precise formalization of compulsory properties of the translation of triple graph grammars intoforward and backward graph translation functions is given. Regarding these properties an interpretation and implementationof negative application conditions is derived that does not destroy the benefits of the original approach. Additionally anew demand-driven forward/backward translation rule application strategy is proposed. It guarantees for the first time automaticallya correct ordering of rule applications without imposing any additional requirements on the structure of the regarded graphs.
@inproceedings{schuerr-klar:08,
abstract = {Triple graph grammars (TGGs) have been invented 15 years ago as a formalism for the declarative specification of bidirectional
graph-to-graph translations. In this paper we present a list of still open problems concerning the interpretation and theexpressiveness of TGGs. We will comment on extensions proposed to improve the original approach and the drawbacks that arisethereof. Consequently a more precise formalization of compulsory properties of the translation of triple graph grammars intoforward and backward graph translation functions is given. Regarding these properties an interpretation and implementationof negative application conditions is derived that does not destroy the benefits of the original approach. Additionally anew demand-driven forward/backward translation rule application strategy is proposed. It guarantees for the first time automaticallya correct ordering of rule applications without imposing any additional requirements on the structure of the regarded graphs.},
added-at = {2010-03-15T18:31:44.000+0100},
author = {Schürr, Andy and Klar, Felix},
biburl = {https://www.bibsonomy.org/bibtex/2bcb50f527cf6588ffad9ad56933f8dfc/ngeiger},
booktitle = {Graph Transformations, 4th International Conference, ICGT 2008, Leicester, United Kingdom, September 7-13, 2008. Proceedings},
crossref = {ICGT:08},
description = {SpringerLink - Buchkapitel},
editor = {Ehrig, Hartmut and Heckel, Reiko and Rozenberg, Grzegorz and Taentzer, Gabriele},
interhash = {3a55d925776c5de6711d94160bbf7510},
intrahash = {bcb50f527cf6588ffad9ad56933f8dfc},
keywords = {2008 GraGra TripleGraphGrammars tgg},
pages = {411--425},
series = {Lecture Notes in Computer Science},
timestamp = {2010-03-15T18:31:44.000+0100},
title = {15 Years of Triple Graph Grammars},
url = {http://dx.doi.org/10.1007/978-3-540-87405-8_28},
volume = 5214,
year = 2008
}