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

10/19/2017
by   Michael Blondin, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/30/2020

PrIC3: Property Directed Reachability for MDPs

IC3 has been a leap forward in symbolic model checking. This paper propo...
research
03/03/2020

Sparse Tiling through Overlap Closures for Termination of String Rewriting

We over-approximate reachability sets in string rewriting by languages d...
research
10/10/2018

Recursion Schemes, the MSO Logic, and the U quantifier

We study the model-checking problem for recursion schemes: does the tree...
research
09/11/2023

Soundness and Completeness of a Model-Checking Proof System for CTL

We propose a local model-checking proof system for a fragment of CTL. Th...
research
01/12/2013

Verification of Agent-Based Artifact Systems

Artifact systems are a novel paradigm for specifying and implementing bu...
research
09/26/2017

Quasitrivial semigroups: characterizations and enumerations

We investigate the class of quasitrivial semigroups and provide various ...

Please sign up or login with your details

Forgot password? Click here to reset