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

@inproceedings{Joshi2008ApplyingTG,
  title={Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems},
  author={Salil Joshi and Barbara K{\"o}nig},
  booktitle={CAV},
  year={2008}
}
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. 
28 Citations
8 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Graph minors. XXIII

  • Neil Robertson, Paul Seymour
  • Nash-Williams’ immersion conjecture,
  • 2006
3 Excerpts

Graph minors. XX

  • Neil Robertson, Paul Seymour
  • Wagner’s conjecture. Journal of Combinatorial…
  • 2004
2 Excerpts

Similar Papers

Loading similar papers…