Pith. sign in

REVIEW

Techniques for Distributed Reachability Analysis with Partial Order and Symmetry based Reductions

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 0901.0179 v1 pith:PZQ6N432 submitted 2009-01-01 cs.DC cs.SE

classification cs.DCcs.SE
keywords statetechniquesanalysisdistributedorderpartialreachabilityreductions
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In this work we propose techniques for efficient reachability analysis of the state space (e.g., detection of bad states) using a combination of partial order and symmetry based reductions in a distributed setting. The proposed techniques are focused towards explicit state space enumeration based model-checkers like SPIN. We consider variants for both depth-first as well as breadth-first based generation of the reduced state graphs on-the-fly.

Discussion (0). Continue with ORCID to comment.

Pith tools