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. © 2008 Springer-Verlag.
CITATION STYLE
Joshi, S., & König, B. (2008). Applying the graph minor theorem to the verification of graph transformation systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5123 LNCS, pp. 214–226). https://doi.org/10.1007/978-3-540-70545-1_21
Mendeley helps you to discover research relevant for your work.