EEMCS EPrints Service
Laarman, A.W. and Langerak, R. and van de Pol, J.C. and Weber, Michael and Wijs, A. (2011) Multi-Core Nested Depth-First Search. In: Proceedings of the 9th International Symposium on Automated Technology for Verification and Analysis, ATVA 2011, 11-14 Oct 2011, Tapei, Taiwan. pp. 321-335. Lecture Notes in Computer Science 6996. Springer Verlag. ISBN 978-3-642-24372-1
Full text available as:
Official URL: http://dx.doi.org/10.1007/978-3-642-24372-1_23
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).
Export this item as:
To correct this item please ask your editor
Repository Staff Only: edit this item