2026-07-20T05:29:06Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:29 2024-03-06T11:05:48Z ddc:004 open_access

Summary 2: Graph Grammar Verification through Abstraction Baldan, Paolo König, Barbara Rensink, Arend graph transformation verification 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Paolo Baldan and Barbara König and Arend Rensink 2005 Is Part Of Dagstuhl Seminar Proceedings, Volume 4241, Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems (2005) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.04241.3 urn:nbn:de:0030-drops-291 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04241.3 eng https://creativecommons.org/licenses/by/4.0/legalcode