2012-01: Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems
2012-01: Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems
复制标题
2012-01：将图小定理应用于图变换系统的验证
DOI：
--
复制
发表时间：
2012
期刊：
影响因子：
--
通讯作者：
B. König
中科院分区：
文献类型：
--
作者：
Salil Joshi;B. König
我们展示了如何将（单次推出）图转换系统的某些子类视为结构良好的转换系统，从而通过反向分析导致覆盖问题的可判定性。作为结构良好的跃迁系统所需要的井-拟序，我们使用图小序。我们给出了一个明确的后退步骤的构造，并应用我们的理论来证明领导者选举协议的正确性。
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.