Failure detectors (FD) s are celebrated for their modularity in solving distributed problems.
Algorithms are constructed using FD building blocks. Synchrony assumptions to implement
FDs are studied separately and are typically expressed as eventual guarantees that need to
hold, after some point in time, forever and deterministically. But in practice, they may hold
only probabilistically and temporarily. This paper studies FDs in a realistic system N, where
asynchrony is inflicted by probabilistic synchronous communication. We first address a …