15 Years of triple graph grammars: Research challenges, new contributions, open problems

116Citations
Citations of this article
25Readers
Mendeley users who have this article in their library.
Get full text

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 the expressiveness of TGGs. We will comment on extensions proposed to improve the original approach and the drawbacks that arise thereof. Consequently a more precise formalization of compulsory properties of the translation of triple graph grammars into forward and backward graph translation functions is given. Regarding these properties an interpretation and implementation of negative application conditions is derived that does not destroy the benefits of the original approach. Additionally a new demand-driven forward/backward translation rule application strategy is proposed. It guarantees for the first time automatically a correct ordering of rule applications without imposing any additional requirements on the structure of the regarded graphs. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Schürr, A., & Klar, F. (2008). 15 Years of triple graph grammars: Research challenges, new contributions, open problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5214 LNCS, pp. 411–425). https://doi.org/10.1007/978-3-540-87405-8_28

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free