License
When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-291
URL: http://drops.dagstuhl.de/opus/volltexte/2005/29/
Go to the corresponding Portal


Baldan, Paolo ; König, Barbara ; Rensink, Arend

Summary 2: Graph Grammar Verification through Abstraction

pdf-format:
Document 1.pdf (330 KB)


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.

BibTeX - Entry

@InProceedings{baldan_et_al:DSP:2005:29,
  author =	{Paolo Baldan and Barbara K{\"o}nig and Arend Rensink},
  title =	{Summary 2: Graph Grammar Verification through Abstraction},
  booktitle =	{Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems},
  year =	{2005},
  editor =	{Barbara K{\"o}nig and Ugo Montanari and Philippa Gardner},
  number =	{04241},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2005/29},
  annote =	{Keywords: graph transformation , verification}
}

Keywords: graph transformation , verification
Seminar: 04241 - Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems
Issue Date: 2005
Date of publication: 18.02.2005


DROPS-Home | Fulltext Search | Imprint Published by LZI