Several works in distributed systems have been designed based on the Happened-Before
Relation (HBR). Most of these works intend to be efficient in their implementation by …

Several algorithms of different domains in distributed systems are designed over the
principle of the Happened-Before Relation (HBR). One common as-pect among them is that …

Distributed systems have undergone a very fast evolution in the last years. Large-scale
distributed systems have become an integral part of everyday life with the development of …

In a distributed system, high-level actions can be modeled by nonatomic events. This paper
proposes causality relations between distributed nonatomic events and provides efficient …

This paper analyzes computation of causality relationships in distributed systems. We give a
formal framework based upon partial orders for this study. The initial algorithm dealing with …

An important problem in analyzing distributed computations is the amount of information. In
event-based models, even for simple applications, the number of events is large and the …

A distributed computation is usually modeled as a partially ordered set of relevant events
(the relevant events are a subset of the primitive events produced by the computation). An …

Understanding distributed computations and mastering their complexity strongly depends on
our ability to observe and to analyze their causal structure. In this paper, we briefly introduce …

The causal order in distributed asynchronous systems is a valuable and useful concept to
implement distributed algorithms. In particular, causal broadcasts have been used to solve …

An important problem in event-based models of distributed computations is the amount of
behavioral information. Even for simple applications, the number of events is large and the …