Start Over

Patch Graph Rewriting

Authors :: Overbeek, Roy
Endrullis, Jörg
Gadducci, Fabio
Kehrer, Timo
Theoretical Computer Science
Network Institute
Gadducci, Fabio
Kehrer, Timo
Source :: Graph Transformation: 13th International Conference, ICGT 2020, Held as Part of STAF 2020, Bergen, Norway, June 25–26, 2020, Proceedings, 128-145, STARTPAGE=128;ENDPAGE=145;TITLE=Graph Transformation, Graph Transformation ISBN: 9783030513719, ICGT, Overbeek, R & Endrullis, J 2020, Patch Graph Rewriting . in F Gadducci & T Kehrer (eds), Graph Transformation : 13th International Conference, ICGT 2020, Held as Part of STAF 2020, Bergen, Norway, June 25–26, 2020, Proceedings . Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 12150 LNCS, Springer, pp. 128-145, 13th International Conference on Graph Transformation, ICGT 2020 held as part of Software Technologies: Applications and Foundations, STAF 2020, Bergen, Norway, 25/06/20 . https://doi.org/10.1007/978-3-030-51372-6_8
Publication Year :: 2020
Abstract: The basic principle of graph rewriting is the stepwise replacement of subgraphs inside a host graph. A challenge in such replacement steps is the treatment of the patch graph, consisting of those edges of the host graph that touch the subgraph, but are not part of it. We introduce patch graph rewriting, a visual graph rewriting language with precise formal semantics. The language has rich expressive power in two ways. First, rewrite rules can flexibly constrain the permitted shapes of patches touching matching subgraphs. Second, rules can freely transform patches. We highlight the framework’s distinguishing features by comparing it against existing approaches.