A Decision Diagram Operation for Reachability

12/07/2022
by   Sebastiaan Brand, et al.
0

Saturation is considered the state-of-the-art method for computing fixpoints with decision diagrams. We present a relatively simple decision diagram operation called REACH that also computes fixpoints. In contrast to saturation, it does not require a partitioning of the transition relation. We give sequential algorithms implementing the new operation for both binary and multi-valued decision diagrams, and moreover provide parallel counterparts. We implement these algorithms and experimentally compare their performance against saturation on 692 model checking benchmarks in different languages. The results show that the REACH operation often outperforms saturation, especially on transition relations with low locality. In a comparison between parallelized versions of REACH and saturation we find that REACH obtains comparable speedups up to 16 cores, although falls behind saturation at 64 cores. Finally, in a comparison with the state-of-the-art model checking tool ITS-tools we find that REACH outperforms ITS-tools on 29 useful as a complementary method in an ensemble tool.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/08/2020

Symblicit Exploration and Elimination for Probabilistic Model Checking

Binary decision diagrams can compactly represent vast sets of states, mi...
research
04/30/2020

Using Decision Diagrams to Compactly Represent the State Space for Explicit Model Checking

The enormous number of states reachable during explicit model checking i...
research
12/30/2020

Visual counterexample explanation for model checking with Oeritte

Despite being one of the most reliable approaches for ensuring system co...
research
03/14/2018

Real-time System Modeling and Verification through Labeled Transition System Analyser (LTSA)

With the advancement of software engineering in recent years, the model ...
research
12/18/2020

Petri Net Based Symbolic Model Checking for Computation Tree Logic of Knowledge

Computation Tree Logic of Knowledge (CTLK) can specify many design requi...
research
09/07/2017

ParaPlan: A Tool for Parallel Reachability Analysis of Planar Polygonal Differential Inclusion Systems

We present the ParaPlan tool which provides the reachability analysis of...
research
08/14/2012

Ordered AND, OR-Decomposition and Binary-Decision Diagram

In the context of knowledge compilation (KC), we study the effect of aug...

Please sign up or login with your details

Forgot password? Click here to reset