Perfect failure detection with very few bits

DOI10.1007/978-3-319-49259-9_13zbMath1425.68040OpenAlexW2547528003MaRDI QIDQ5918191

Petr Kuznetsov, Pierre Fraigniaud, Thibault Rieutord, Sergio Rajsbaum, Corentin Travers

Publication date: 22 November 2019

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01365304/file/fdenc-longversion.pdf

zbMATH Keywords

well-quasi-orderHigman's lemmafailure detectors

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (4)

Implementing ♢P with Bounded Messages on a Network of ADD Channels ⋮ Unnamed Item ⋮ Redundancy in distributed proofs ⋮ Perfect failure detection with very few bits

This page was built for publication: Perfect failure detection with very few bits