Techniques for Distributed Reachability Analysis with Partial Order and Symmetry based Reductions
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:PZQ6N432record.jsonopen to challenge →
classification
cs.DC
cs.SE
keywords
statetechniquesanalysisdistributedorderpartialreachabilityreductions
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.