Forward analysis and model checking for trace bounded WSTS

We investigate a subclass of well-structured transition systems (WSTS), the trace bounded-in the sense of Ginsburg and Spanier (1964), [1]-complete deterministic ones, which we claim provide an adequate basis for the study of forward analyses as developed by Finkel and Goubault-Larrecq (2012), [2]. Indeed, we prove that, unlike other conditions considered previously for the termination of forward analysis, trace boundedness is decidable. Trace boundedness turns out to be a valuable restriction for WSTS verification, as we show that it further allows to decide all ω-regular properties on the set of infinite traces of the system.