We present an implementation of Global-Flush Primitives using counters. This
implementation costs comparable to the most lightweight implementation of causal ordering …

To reverse engineer scenarios from event traces, one must infer causal relationships
between events. The inferences are usually based on a trace with sequence numbers or …

Formal methods for deciding the properties of service oriented systems are of paramount
importance. However, they may require to master sophisticated techniques that …

Temporal logic has become a well-established method for specifying the behavior of
distributed systems. In this paper, we interpret a temporal logic over a partial order model …

In a distributed computing system, message logging is widely used for providing nodes with
recoverability. To reduce the piggyback overhead of traditional causal message logging, we …

The paper describes a causal broadcast communication interface that allows distributed
applications to flexibly and uniformly specify message ordering requirements. The interface …

The vector clock is a fundamental tool for tracking causality in distributed applications.
Unfortunately, it does not scale well to large systems because each process needs to …

Causality tracking mechanisms, such as vector clocks and version vectors, rely on mappings
from globally unique identifiers to integer counters. In a system with a well known set of …

Causal broadcast is a fundamental building block of many distributed or parallel
applications such as distributed databases, pub-sub, or social networks, which all need to …

Causal order states that for any process the order in which it is delivered messages cannot
violate the happened-before relation of the corresponding sendings. Such a communication …