An algorithm for identification of maliciously faulty units

DOI10.1080/00207169308804189MaRDI QIDQ4323717zbMATH OpenOpenAlexFDO

Authors Franc Novak, Sandi Klavžar

Publication date 28 May 1995

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207169308804189

zbMATH Keywords

Byzanthine agreementfault tolerancefully connected systemmalicious unit

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 1304102
• An Algorithm for Determining the Fault Diagnosability of a System
• A Fault Identification Algorithm for t_i-Diagnosable Systems
• An 0(n^2.5) Fault Identification Algorithm for Diagnosable Systems
• A parallel fault identification algorithm
• A O(t/sup 3/+ mod E mod ) fault identification algorithm for diagnosable systems
• scientific article; zbMATH DE number 1301616
• scientific article; zbMATH DE number 1534927

Cites work

• A lower bound for the time to assure interactive consistency
• Authenticated Algorithms for Byzantine Agreement
• Easy impossibility proofs for distributed consensus problems
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• The Byzantine generals strike again

Cited in

(1)

• A flexible formal framework for masking/demasking faults

This page was built for publication: An algorithm for identification of maliciously faulty units

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