The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings

DOI10.1007/978-3-030-30229-0_3zbMath1446.68191arXiv1904.10703OpenAlexW2941511937MaRDI QIDQ3295146

Jean Goubault-Larrecq, K. Narayan Kumar, Simon Halfon, Prateek Karandikar, Philippe Schnoebelen

Publication date: 8 July 2020

Published in: Trends in Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1904.10703

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Other combinatorial set theory (03E05)

Related Items (4)

Infinitary Noetherian constructions II. Transfinite words and the regular subword topology ⋮ On Arch Factorization and Subword Universality for Words and Compressed Words ⋮ Existential Definability over the Subword Ordering ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Set systems: order types, continuous nondeterministic deformations, and quasi-orders
• Graph minors. XX: Wagner's conjecture
• The residue of vector sets with applications to decidability problems in Petri nets
• Ordinal arithmetic: Algorithms and mechanization
• On well-quasi-ordering finite structures with labels
• Termination of rewriting
• What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory
• A note on well quasi-orderings for powersets
• Handling infinitely branching well-structured transition systems
• The ideal theory for WSTS
• Logic, semigroups and automata on words
• Algorithmic analysis of programs with well quasi-ordered domains.
• Using forward reachability analysis for verification of lossy channel systems
• Computable fixpoints in well-structured symbolic model checking
• Parallel program schemata
• The theory of well-quasi-ordering: a frequently discovered concept
• Expand, enlarge and check: new algorithms for the coverability problem of WSTS
• Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity
• Complexity Hierarchies beyond Elementary
• The Power of Well-Structured Systems
• Computing Downward Closures for Stacked Counter Automata
• Timed lossy channel systems
• The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched Nets
• Multiply-Recursive Upper Bounds with Higman’s Lemma
• Graph minor theory
• Complexity Bounds for Ordinal-Based Termination
• Well Quasi-orders in Formal Language Theory
• The Downward-Closure of Petri Net Languages
• Forward Analysis for WSTS, Part II: Complete WSTS
• Proving termination with multiset orderings
• Une extension d'un théorème de P. Jullien sur les âges de mots
• Deciding Piecewise Testable Separability for Regular Tree Languages
• Demystifying Reachability in Vector Addition Systems
• The Complexity of Coverability in ν-Petri Nets
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
• On free monoids partially ordered by embedding
• Ordering by Divisibility in Abstract Algebras
• Partial well‐ordering of sets of vectors
• The Power of Priority Channel Systems
• The ideal view on Rackoff's coverability technique
• Free differential calculus. IV: The quotient groups of the lower central series
• Well-structured transition systems everywhere!
• Fine analysis of the quasi-orderings on the power set

This page was built for publication: The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderings