Creative Commons Attribution 4.0 license (CC BY 4.0)when quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.04241.3
URN: urn:nbn:de:0030-drops-291
URL: https://drops.dagstuhl.de/opus/volltexte/2005/29/
Baldan, Paolo ; König, Barbara ; Rensink, Arend
Summary 2: Graph Grammar Verification through Abstraction
| pdf-format: |
|
Abstract
Until now there have been few contributions concerning theverification 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:DagSemProc.04241.3,
author = {Baldan, Paolo and K\"{o}nig, Barbara and Rensink, Arend},
title = {{Summary 2: Graph Grammar Verification through Abstraction}},
booktitle = {Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems},
pages = {1--9},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2005},
volume = {4241},
editor = {Barbara K\"{o}nig and Ugo Montanari and Philippa Gardner},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2005/29},
URN = {urn:nbn:de:0030-drops-291},
doi = {10.4230/DagSemProc.04241.3},
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 |
