A work-efficient distributed algorithm for reachability analysis
From MaRDI portal
Publication:2431764
DOI10.1007/s10703-006-0011-4zbMath1110.68075OpenAlexW2078620789MaRDI QIDQ2431764
Assaf Schuster, Tamir Heyman, Orna Grumberg
Publication date: 24 October 2006
Published in: Formal Methods in System Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10703-006-0011-4
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed algorithms (68W15)
Related Items (3)
Automated constraint-based addition of nonmasking and stabilizing fault-tolerance ⋮ A compositional approach to probabilistic knowledge compilation ⋮ Distributed Verification of Multi-threaded C++ Programs
Uses Software
Cites Work
This page was built for publication: A work-efficient distributed algorithm for reachability analysis