Ideal-Based Algorithms for the Symbolic Verification of Well-Structured Systems (Invited Talk)
Philippe Schnoebelen · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 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.