Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Computation Slicing: Techniques and Theory
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
| Hi-index | 0.00 |
In this paper, we present a new technique called multislicing to efficiently verify whether a distributed program has executed correctly. Our algorithm supports a class of temporal predicates (Multislicing Temporal Logic or MTL [1]) which allows properties based on local predicates and arbitrarily placed negations, disjunctions and conjunctions along with the possibly (⋄ , EF) temporal operator. We show that multislicing makes it possible to detect any MTL predicate in polynomial time with respect to the number of processes (n) in the system and the number of events (|E|) in the distributed computation (though, as expected, it is not polynomial with respect to the size of the predicate) [1]. We do not know of any other algorithm that allows detection of a similar class of predicates in polynomial time in n (or |E|).