Consistent detection of global predicates
PADD '91 Proceedings of the 1991 ACM/ONR workshop on Parallel and distributed debugging
Testing and Debugging Distributed Programs Using Global Predicates
IEEE Transactions on Software Engineering
Detection of Strong Unstable Predicates in Distributed Programs
IEEE Transactions on Parallel and Distributed Systems
Efficient Distributed Detection of Conjunctions of Local Predicates
IEEE Transactions on Software Engineering
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Detection of Weak Unstable Predicates in Distributed Programs
IEEE Transactions on Parallel and Distributed Systems
Efficient Detection of Restricted Classes of Global Predicates
WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms
Detecting Temporal Logic Predicates on the Happened-Before Model
IPDPS '02 Proceedings of the 16th International Symposium on Parallel and Distributed Processing
On Slicing a Distributed Computation
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Predicate Control for Active Debugging of Distributed Programs
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Techniques and applications of computation slicing
Distributed Computing
| Hi-index | 0.00 |
Given a distributed computation and a predicate, detection of the predicate in $\mathit{Definitely}$ modality means checking whether in every path from the least state to the greatest state in the state space generated from the computation, there exists a state satisfying the predicate. It is well known that the state space is a lattice. The regular predicate is a class of predicates. All the states satisfying a regular predicate form a sublattice of the lattice. In this paper, we prove that detection of a regular predicate in $\mathit{Definitely}$ modality is coNP-complete.