Treffer: Parameterized verification of graph transformation systems withwhole neighbourhood operations
Title:
Parameterized verification of graph transformation systems withwhole neighbourhood operations
Authors:
Contributors:
Delzanno, Giorgio*, Delzanno, Giorgio, Stückrath, Jan
Publisher Information:
Springer Verlag
Publication Year:
2014
Collection:
Università degli Studi di Genova: CINECA IRIS
Subject Terms:
Document Type:
Konferenz
conference object
File Description:
STAMPA
Language:
English
Relation:
ispartofbook:Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Reachability Problems; firstpage:72; lastpage:84; numberofpages:13; journal:LECTURE NOTES IN COMPUTER SCIENCE; https://hdl.handle.net/11567/893581
Availability:
Accession Number:
edsbas.32184422
Database:
BASE
Weitere Informationen
We introduce a new class of graph transformation systems in which rewrite rules can be guarded by universally quantified conditions on the neighbourhood of nodes. These conditions are defined via special graph patterns which may be transformed by the rule as well. For the new class for graph rewrite rules, we provide a symbolic procedure working on minimal representations of upward closed sets of configurations. We prove correctness and effectiveness of the procedure by a categorical presentation of rewrite rules as well as the involved order, and using results for well-structured transition systems. We apply the resulting procedure to the analysis of the Distributed Dining Philosophers protocol on an arbitrary network structure.