The coordination of a sequence of actions, to be performed in a linear temporal order in a
distributed system, is studied. While in asynchronous message-passing systems such …

In order to characterize and capture the causal relationships between events in a distributed
history, logical clocks have been used in distributed systems with diverse degrees of …

Causal message ordering is required for several distributed applications. In order to
preserve causal ordering, only direct dependency information between messages with …

Monitoring and troubleshooting distributed systems are notoriously difficult; potential
problems are complex, varied, and unpredictable. The monitoring and diagnosis tools …

An important problem in distributed systems is observation of global properties of distributed
computations. What makes this problem difficult is that events in the computation can be …

An optimal causal message ordering algorithm for asynchronous distributed systems was
proposed by Kshemkalyani and Singhal and its optimality was proven theoretically. For a …

We consider different ways of combining discrete and timed condition/event systems in a
modular, compositional way. In addition to the interconnection operators for discrete …

We consider the problem of distinguishing causally-consistent global states in asynchronous
distributed systems. Such states are fundamental to asynchronous systems, because they …

In this paper, we propose the hierarchical daisy architecture, which provides causal delivery
of messages sent to any subset of processes. The architecture provides fault tolerance and …

Data-dependencies of the type" x can tell us more about y given that we already know z" can
be represented in various formalisms: Probabilistic Dependencies, Embedded-Multi-Valued …