Minimizing the Number of Opinions for Fault-Tolerant Distributed Decision Using Well-Quasi Orderings

DOI10.1007/978-3-662-49529-2_37zbMath1475.68205OpenAlexW2462957551MaRDI QIDQ2802963

Sergio Rajsbaum, Corentin Travers, Pierre Fraigniaud

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

zbMATH Keywords

well-quasi-orderingdistributed decisioncombinatorial topologyruntime verificationdistributed verificationwait-free computing

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)

Related Items (5)

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

This page was built for publication: Minimizing the Number of Opinions for Fault-Tolerant Distributed Decision Using Well-Quasi Orderings