Detecting temporal logic predicates on the happened-before model

A. Sen, V. K. Garg
2002 Proceedings 16th International Parallel and Distributed Processing Symposium  
Detection of a global predicate is a fundamental problem in distributed computing. In this paper we describe new predicate detection algorithms for certain temporal logic predicates. We use a temporal logic, CTL, for specifying properties of a distributed computation and interpret it on a finite lattice of global states. We present solutions to the predicate detection of linear and observer-independent predicates under £ ¥ ¤ and ¦ § ¤ operators of CTL. For linear predicates we develop
more » ... -time predicate detection algorithms which exploit the structure of finite distributive lattices. For observer-independent predicates we prove that predicate detection is NP-complete under £ ¥ ¤ operator and co-NP-complete under ¦ ¤ operator. We also present polynomial-time algorithms for a CTL operator called until , for which such algorithms did not exist. Finally, our work unifies many earlier results in predicate detection in a single framework.
doi:10.1109/ipdps.2002.1015583 dblp:conf/ipps/SenG02 fatcat:326idkovgvbm3etxfjwj7dv3w4