Forward Analysis for WSTS, Part II: Complete WSTS
نویسندگان
چکیده
We describe a simple, conceptual forward analysis procedure for ∞complete WSTS S. This computes the clover of a state s0, i.e., a finite description of the closure of the cover of s0. When S is the completion of a WSTS X, the clover in S is a finite description of the cover in X. We show that this applies exactly when X is an ω-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.
منابع مشابه
Forward Analysis for WSTS, Part III: Karp-Miller Trees
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 downwardsclosed sets. We further ...
متن کاملThe Theory of WSTS: The Case of Complete WSTS
We describe a simple, conceptual forward analysis procedure for ∞-complete WSTS S. This computes the so-called clover of a state. When S is the completion of a WSTS X, the clover in S is a finite description of the downward closure of the reachability set. We show that such completions are ∞-complete exactly when X is an ω-WSTS , a new robust class of WSTS. We show that our procedure terminates...
متن کاملForward Analysis and Model Checking for Bounded WSTS
We investigate a subclass of well-structured transition systems (WSTS), the bounded—in the sense of Ginsburg and Spanier (Trans. AMS 1964)— complete deterministic ones, which we claim provide an adequate basis for the study of forward analyses as developed by Finkel and GoubaultLarrecq (ICALP 2009b). Indeed, we prove that, unlike other conditions considered previously for the termination of for...
متن کاملForward Analysis and Model Checking for Trace Bounded WSTS
We investigate a subclass of well-structured transition systems (WSTS), the bounded—in the sense of Ginsburg and Spanier (Trans. AMS 1964)— complete deterministic ones, which we claim provide an adequate basis for the study of forward analyses as developed by Finkel and GoubaultLarrecq (ICALP 2009b). Indeed, we prove that, unlike other conditions considered previously for the termination of for...
متن کاملIdeal Abstractions for Well-Structured Transition Systems
Many infinite state systems can be seen as well-structured transition systems (WSTS), i.e., systems equipped with a well-quasi-ordering on states that is also a simulation relation. WSTS are an attractive target for formal analysis because there exist generic algorithms that decide interesting verification problems for this class. Among the most popular algorithms are acceleration-based forward...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009