文章基本信息

标题：Ideal-Based Algorithms for the Symbolic Verification of Well-Structured Systems (Invited Talk)
本地全文：下载
作者：Philippe Schnoebelen
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2017
卷号：83
页码：85:1-85:4
DOI：10.4230/LIPIcs.MFCS.2017.85
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：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.
关键词：Well-structured systems and verification; Order theory