Abstract | ||
---|---|---|
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 neration,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. |
Year | Venue | Field |
---|---|---|
2015 | ECEASST | Graph,Model transformation,Triple graph grammars,Computer science,Incremental build model,Theoretical computer science,Conformance testing,Binary number |
DocType | Volume | Citations |
Journal | 73 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Anthony Anjorin | 1 | 192 | 28.25 |
Erhan Leblebici | 2 | 47 | 8.24 |
Andy Schürr | 3 | 2195 | 230.25 |