Multi-core Nested Depth-First Search

@inproceedings{Laarman2011MulticoreND,
  title={Multi-core Nested Depth-First Search},
  author={Alfons Laarman and Rom Langerak and Jaco van de Pol and Michael Weber and Anton Wijs},
  booktitle={ATVA},
  year={2011}
}
The LTL Model Checking problem is reducible to finding accepting cycles in a graph. The Nested Depth-First Search (Ndfs) algorithm detects accepting cycles efficiently: on-the-fly, with linear-time complexity and negligible memory overhead. The only downside of the algorithm is that it relies on an inherently-sequential, depth-first search. It has not been parallelized beyond running the independent nested search in a separate thread (dual core). In this paper, we introduce, for the first time… CONTINUE READING
Highly Cited
This paper has 44 citations. REVIEW CITATIONS