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

Simple item page
dc.creatorMisra, Janardan
dc.creatorRoy, Suman
dc.date2009-01-01
dc.date.accessioned2026-07-07T12:23:45Z
dc.date.available2026-07-07T12:23:45Z
dc.descriptionIn 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.
dc.identifierhttps://arxiv.org/abs/0901.0179
dc.identifierhttp://arxiv.org/abs/0901.0179
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/214097
dc.subjectDistributed, Parallel, and Cluster Computing
dc.subjectSoftware Engineering
dc.titleTechniques for Distributed Reachability Analysis with Partial Order and Symmetry based Reductions
dc.typetext

Files

Collections

arXiv