Traces and partial order model checking have been used as an approach to reduce time
and memory in model-checking of concurrent programs. We show here that we can also …

Data consistency is a critical topic in distributed systems. In existing consistency models,
causal consistency has attracted a significant amount of attention because it can satisfy high …

Causal order delivery of messages is required for many distributed applications. One of the
problems with causal order delivery algorithms is the need to attach the dependency …

A partial order based graph model for concurrency is introduced, using hierarchical
structured graphs with relations denoting concurrency, causal ordering, and temporal …

Almost all published work on causal ordering mechanisms assumes theoretically
unbounded counters for timestamps, thus ignoring the real world problem that arises if one …

In this work we propose an efficient real-time causal broadcast algorithm with fault tolerance
to unreliable networks. The algorithm allows for the delivery of causal messages with …

In distributed systems it is often important to be able to determine the temporal relationships
between events generated by different processes. An algorithm to determiue such …

Constraint-based (CB) methods are widely used for discovering causal relationships in
observational data. The PC-stable algorithm is a prominent example of CB methods. A …

Complex systems, such as communication networks, generate thousands of new data points
about the system state every minute. Even if faults are rare events, they can easily …

In recent years there has been a growing interest in developing communication systems that
are able to deliver messages respecting potential causality. Unfortunately, causal delivery …