Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems

We show how to view certain subclasses of (single-pushout) graph transformation systems as well-structured transition systems, which leads to decidability of the covering problem via a backward analysis. As the well-quasi order required for a well-structured transition system we use the graph minor...

Full description

Saved in:
Bibliographic Details
Published inComputer Aided Verification pp. 214 - 226
Main Authors Joshi, Salil, König, Barbara
Format Book Chapter
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg
SeriesLecture Notes in Computer Science
Online AccessGet full text

Cover

More Information
Summary:We show how to view certain subclasses of (single-pushout) graph transformation systems as well-structured transition systems, which leads to decidability of the covering problem via a backward analysis. As the well-quasi order required for a well-structured transition system we use the graph minor ordering. We give an explicit construction of the backward step and apply our theory in order to show the correctness of a leader election protocol.
Bibliography:Research partially supported by the DFG project SANDS.
ISBN:9783540705437
3540705430
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-540-70545-1_21