| Publication type: |
Article in Proceedings |
| Author: |
Annegret Habel, Berthold Hoffmann |
| Title: |
Parallel Independence in Hierarchical Graph Transformation |
| Book / Collection title: |
International Conference on Graph Transformation |
| Page(s): |
178 – 193 |
| Series: |
Lecture Notes in Computer Science |
| Number: |
3256 |
| Year published: |
2004 |
| Publisher: |
Springer-Verlag Heidelberg |
| Abstract: |
Hierarchical graph transformation extends double-pushout graph transformation in the spirit of term rewriting: Graphs are provided with hierarchical structure, and transformation rules are equipped with graph variables. In this paper we analyze conditions under which diverging transformation steps can be joined by subsequent transformation sequences. Conditions for joinability have been found for graph transformation (called parallel independence) and for term rewriting (known as non-critical overlap). Both conditions carry over to hierarchical graph transformation. Moreover, the more general structure of hierarchical graphs and of transformation rules leads to a refined condition, termed fragmented parallel independence, which subsumes both parallel independence and non-critical overlap as special cases.
|
| PDF Version: |
http://www.informatik.uni-bremen.de/~hof/papers/ICGT04.pdf |
| PostScript Version: |
http://www.informatik.uni-bremen.de/~hof/papers/ICGT04.ps.gz |
| Keywords: |
hierarchical graph, graph transformation |
| Status: |
Reviewed |
| Last updated: |
11. 10. 2004 |
