20 years of triple graph grammars: A roadmap for future research
Journal article, 2016

Triple graph grammars (TGGs) provide a declarative, rule-based means of specifying binary consistency relationships between different types of graphs. Over the last 20 years, TGGs have been applied successfully in a range of application scenarios including: model generation, conformance testing, bidirectional model transformation, and incremental model synchronisation. In this paper, we review the progress made in TGG research up until now by exploring multiple research dimensions, including both the current frontiers of TGG research as well as important future challenges. Our aim is to provide a roadmap for the coming years of TGG research by stating clearly what we regard as adequately researched, and what we view as still unexplored potential.

Model synchronisation

Bidirectional model transformation

Triple graph grammars


Anthony Anjorin

University of Gothenburg

Chalmers, Computer Science and Engineering (Chalmers), Software Engineering (Chalmers)

E. Leblebici

Technische Universität Darmstadt

A. Schürr

Technische Universität Darmstadt

Electronic Communications of the EASST

1863-2122 (ISSN)

Vol. 73 1 1-20

Subject Categories

Computer Science



More information

Latest update

7/8/2019 1