Forward Analysis for WSTS, Part III: Karp-Miller Trees

Abstract : This paper is a sequel of "Forward Analysis for WSTS, Part I: Completions" [STACS 2009, LZI Intl. Proc. in Informatics 3, 433–444] and "Forward Analysis for WSTS, Part II: Complete WSTS" [Logical Methods in Computer Science 8(3), 2012]. In these two papers, we provided a framework to conduct forward reachability analyses of WSTS, using finite representations of downwards-closed sets. We further develop this framework to obtain a generic Karp-Miller algorithm for the new class of very-WSTS. This allows us to show that coverability sets of very-WSTS can be computed as their finite ideal decompositions. Under natural assumptions on positive sequences, we also show that LTL model checking for very-WSTS is decidable. The termination of our procedure rests on a new notion of acceleration levels, which we study. We characterize those domains that allow for only finitely many accelerations, based on ordinal ranks.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01736704
Contributor : Michael Blondin <>
Submitted on : Sunday, March 18, 2018 - 1:48:43 PM
Last modification on : Wednesday, September 4, 2019 - 11:12:58 AM

Links full text

Identifiers

Citation

Michael Blondin, Alain Finkel, Jean Goubault-Larrecq. Forward Analysis for WSTS, Part III: Karp-Miller Trees. 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), Dec 2017, Kanpur, India. ⟨10.4230/LIPIcs.FSTTCS.2017.16⟩. ⟨hal-01736704⟩

Share

Metrics

Record views

75