Consistent Detection of Global Predicates

Abstract

A fundamental problem in debugging and monitoring is detecting whether the state of system satisfies some predicate. If the system is distributed, then the resulting uncertainty in the state of the system makes such dectection, in general, ill-defined. This paper presents three algorithms for detecting global predicates in a well-defined way. These algorithms do so by interpreting predicates with respect to the communication that has occured in the system.