Publication type: |
Article in Proceedings |
Author: |
Frank Drewes, Berthold Hoffmann, Mark Minas |
Editor: |
Peter Knirsch, Hans-Jörg Kreowski |
Title: |
Constructing Shapely Nested Graph Transformations |
Book / Collection title: |
Proc. Int'l Workshop on Applied Graph Transformation (AGT'02) |
Year published: |
2002 |
Publisher: |
Universite de Grenoble |
Abstract: |
Shapely nested graph transformation is the computational model for DIAPLAN, a language for programming with graphs representing diagrams that is currently being developed.
This model supports nested structuring of graphs, graph variables, and structural graph types (shapes), but is still intuitive.
In this paper, we show that the construction of shapely nested graph transformation steps can be reduced to solving the subgraph isomorphism and variable matching problem for the components of a structured graph, and devise restrictions of the transformation rules that improve efficiency.
Shapes provide useful structural information about the graphs involved in a transformation step, and may therefore further improve efficiency.
|
PDF Version: |
http://www.informatik.uni-bremen.de/~hof/papers/AGT02.pdf |
PostScript Version: |
http://www.informatik.uni-bremen.de/~hof/papers/AGT02.ps.gz |
Status: |
Reviewed |
Last updated: |
18. 03. 2004 |