  Analyzing a distributed computation is a hard problem in general due to the
combinatorial explosion in the size of the state-space with the number of
processes in the system. By abstracting the computation, unnecessary
explorations can be avoided. Computation slicing is an approach for abstracting
dis- tributed computations with respect to a given predicate. We focus on
regular predicates, a family of predicates that covers a large number of
commonly used predicates for runtime verification. The existing algorithms for
computation slicing are centralized in nature in which a single process is
responsible for computing the slice in either offline or online manner. In this
paper, we present a distributed online algorithm for computing the slice of a
distributed computation with respect to a regular predicate. Our algorithm
distributes the work and storage requirements across the system, thus reducing
the space and computation complexities per process. In addition, for
conjunctive predicates, our algorithm also reduces the message load per
process.
