Until now there have been few contributions concerning the verification of graph grammars, specifically of infinite-state graph grammars. This paper compares two existing approaches, based on abstractions of graph transformation systems. While in the unfolding approach graph grammars are approximated by Petri nets, in the partitioning approach graphs are abstracted according to their local structure. We describe differences and similarities of the two approaches and explain the underlying ideas.
|Name||Dagstuhl Seminar Proceedings|
|Conference||Dagstuhl Seminar on Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems 2004|
|Period||6/06/05 → 11/06/05|
- Graph Transformation