Consistent detection of global predicates
PADD '91 Proceedings of the 1991 ACM/ONR workshop on Parallel and distributed debugging
Temporal interactions of intervals in distributed systems
Journal of Computer and System Sciences
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
Faster Possibility Detection by Combining Two Approaches
WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms
Distributed algorithms for detecting conjunctive predicates
ICDCS '95 Proceedings of the 15th International Conference on Distributed Computing Systems
A Fine-Grained Modality Classification for Global Predicates
IEEE Transactions on Parallel and Distributed Systems
Distributed algorithm to detect strong conjunctive predicates
Information Processing Letters
Causality-Based Predicate Detection across Space and Time
IEEE Transactions on Computers
Formal Verification of Simulation Traces Using Computation Slicing
IEEE Transactions on Computers
Data-stream-based global event monitoring using pairwise interactions
Journal of Parallel and Distributed Computing
Distributed Computing: Principles, Algorithms, and Systems
Distributed Computing: Principles, Algorithms, and Systems
Immediate detection of predicates in pervasive environments
Journal of Parallel and Distributed Computing
| Hi-index | 0.89 |
Given a conjunctive predicate @f over a distributed execution, this paper gives an algorithm to detect all interval sets, each interval set containing one interval per process, in which the local values satisfy the Definitely(@f) modality. The time complexity of the algorithm is O(n^3p), where n is the number of processes and p is the bound on the number of times a local predicate becomes true at any process. The paper also proves that unlike the Possibly(@f) modality which admits O(p^n) solution interval sets, the Definitely(@f) modality admits O(np) solution interval sets. The paper also gives an on-line test to determine whether all solution interval sets can be detected in polynomial time under arbitrary fine-grained causality-based modality specifications.