Stronger Reduction Criteria for Local First Search

Abstract

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 question 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 providing an improvement of high potential, as is illustrated by experimental results.

Partial Order Reductions for Model Checking Temporal-epistemic Logics over Interleaved Multi-agent Systems

“…In the literature, partial order reduction has been studied intensively for asynchronous systems, e.g., [22,6,17,9,15,5,19,11]. The technique permits the exploration of a portion of the state space when checking for satisfaction of a formula in a system.…”

Towards Partial Order Reduction for Model Checking Temporal Epistemic Logic

“…In the literature, partial order reduction has been studied intensively for asynchronous systems, e.g., [22,6,17,9,15,5,19,11]. The technique permits the exploration of a portion of the state space when checking for satisfaction of a formula in a system.…”