Ideal-Based Algorithms for the Symbolic Verification of Well-Structured Systems (Invited Talk).
MFCS(2017)
摘要
We explain how the downward-closed subsets of a well-quasi-ordering (X,leq) can be represented via the ideals of X and how this leads to simple and efficient algorithms for the verification of well-structured systems.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络