Minimizing the number of opinions for fault-tolerant distributed decision using well-quasi orderings

DOI10.1007/978-3-662-49529-2_37zbMATH Open1475.68205OpenAlexW2462957551MaRDI QIDQ2802963FDOQ2802963

Authors: Pierre Fraigniaud, Sergio Rajsbaum, Corentin Travers 

Publication date: 3 May 2016

Published in: LATIN 2016: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-49529-2_37

Recommendations

• A hierarchy of local decision
• scientific article; zbMATH DE number 6820307
• Survey of distributed decision
• A topological treatment of early-deciding set-agreement
• Early-deciding consensus is expensive

zbMATH Keywords

combinatorial topologyruntime verificationdistributed verificationwell-quasi-orderingwait-free computingdistributed decision

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (5)

• A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring
• Redundancy in distributed proofs
• Redundancy in distributed proofs
• Perfect failure detection with very few bits
• Consistently-detecting monitors

This page was built for publication: Minimizing the number of opinions for fault-tolerant distributed decision using well-quasi orderings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802963)