Well-structured transition systems everywhere!

We propose a relaxation to the definition of a well-structured transition systems (WSTS) while retaining the decidability of boundedness and termination. In this class, we ease the well-quasi-ordered (wqo) condition to be applicable only between ...

We prove that a class of matroids representable over a fixed finite field and with bounded branch-width is well-quasi-ordered under taking minors. With some extra work, the result implies Robertson and Seymour's result that graphs with bounded tree-...

We characterize the importance of resources (like counters, channels, or alphabets) when measuring the expressiveness of Well-Structured Transition Systems (WSTS). We establish, for usual classes of well partial orders, the equivalence between the ...