On-the-fly detection of conjunctions of local predicates in distributed computations

Global predicate detection is a fundamental problem in distributed systems and finds applications in many domains such as testing and debugging distributed programs. The paper presents an efficient distributed algorithm to detect conjunctive form global predicates in distributed systems. The algorithm detects the first consistent global state that satisfies a given conjunction of local predicates. The algorithm is distributed because the predicate detection efforts as well as the necessary information is equally distributed among the processes.