2000 character limit reached
Techniques for Distributed Reachability Analysis with Partial Order and Symmetry based Reductions
Published 1 Jan 2009 in cs.DC and cs.SE | (0901.0179v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.