@inproceedings{c90149286e184f7a984ec72c8e32b736,
title = "Graph Grammar Verification through Abstraction",
abstract = "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.",
keywords = "Graph Transformation, Verification",
author = "Paolo Baldan and Barbara Koenig and Arend Rensink",
year = "2005",
language = "English",
series = "Dagstuhl Seminar Proceedings",
publisher = "Dagstuhl",
editor = "Barbara K{\"o}nig and Ugo Montanari and Philippa Gardner",
booktitle = "Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems",
address = "Germany",
note = "Dagstuhl Seminar on Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems 2004 ; Conference date: 06-06-2005 Through 11-06-2005",
}