Local First Search (LFS) is a partial order technique for reducing the number of states to be explored when trying to decide reachability of a local (component) property in a parallel system; it is based on an analysis of the structure of the partial orders of executions in such systems. Intuitively, LFS is based on a criterion that allows to guide the search for such local properties by limiting the “concurrent progress��? of components. In this paper, we elaborate the analysis of the partial orders in ques- tion and obtain related but significantly stronger criteria for reductions, show their relation to the previously established criterion, and discuss the algorithmics of the proposed improvement. Our contribution is both fundamental in providing better insights into LFS and practical in pro- viding an improvement of high potential.
|Title of host publication||Proceedings of the Third International Colloquium on Theoretical Aspects of Computing|
|Editors||Kamel Barkaoui, Ana Cavalcanti, Antonio Cerone|
|Place of Publication||Berlin|
|Number of pages||15|
|Publication status||Published - 26 Oct 2006|
|Name||Lecture Notes in Computer Science|
Kurban, M. E., Niebert, P., Qu, H., & Vogler, W. (2006). Stronger reduction criteria for Local First Search. In K. Barkaoui, A. Cavalcanti, & A. Cerone (Eds.), Proceedings of the Third International Colloquium on Theoretical Aspects of Computing (pp. 108-122). (Lecture Notes in Computer Science; Vol. 4281/2006). Berlin: Springer. https://doi.org/10.1007/11921240_8