Forward Analysis for WSTS, Part II: Complete WSTS
- Cite this paper as:
- Finkel A., Goubault-Larrecq J. (2009) Forward Analysis for WSTS, Part II: Complete WSTS. In: Albers S., Marchetti-Spaccamela A., Matias Y., Nikoletseas S., Thomas W. (eds) Automata, Languages and Programming. ICALP 2009. Lecture Notes in Computer Science, vol 5556. Springer, Berlin, Heidelberg
We describe a simple, conceptual forward analysis procedure for ∞-complete WSTS \(\mathfrak S\). This computes the clover of a state s0, i.e., a finite description of the closure of the cover of s0. When \(\mathfrak S\) is the completion of a WSTS \(\mathfrak X\), the clover in \(\mathfrak S\) is a finite description of the cover in \(\mathfrak X\). We show that this applies exactly when \(\mathfrak X\) is an ω2-WSTS, a new robust class of WSTS. We show that our procedure terminates in more cases than the generalized Karp-Miller procedure on extensions of Petri nets. We characterize the WSTS where our procedure terminates as those that are clover-flattable. Finally, we apply this to well-structured counter systems.
Unable to display preview. Download preview PDF.