Summary 2: Graph Grammar Verification through Abstraction

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

doi:10.4230/DagSemProc.04241.3

Document

Summary 2: Graph Grammar Verification through Abstraction

Authors Paolo Baldan, Barbara König, Arend Rensink

Part of: Volume: Dagstuhl Seminar Proceedings, Volume 4241
Part of: Series: Dagstuhl Seminar Proceedings (DagSemProc)
License: Creative Commons Attribution 4.0 International license
Publication Date: 2005-02-18

PDF

File

PDF

DagSemProc.04241.3.pdf

Filesize: 330 kB
9 pages

Document Identifiers

DOI: 10.4230/DagSemProc.04241.3
URN: urn:nbn:de:0030-drops-291

Subject Classification

Keywords

graph transformation
verification

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

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.

Cite As Get BibTex

Paolo Baldan, Barbara König, and Arend Rensink. Summary 2: Graph Grammar Verification through Abstraction. In Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems. Dagstuhl Seminar Proceedings, Volume 4241, pp. 1-9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005) https://doi.org/10.4230/DagSemProc.04241.3

Author Details

Paolo Baldan

Barbara König

Arend Rensink

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail