A flexible formal framework for masking/demasking faults

DOI10.1016/J.INS.2003.03.004MaRDI QIDQ1827146zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 6 August 2004

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2003.03.004

zbMATH Keywords

Byzantine problemsDistributed systemsFault identificationGlobal agreementMasking vs. identifying faults

Mathematics Subject Classification ID

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

Recommendations

• An algorithm for identification of maliciously faulty units
• Byzantine Fault Detectors for Solving Consensus
• Efficient agreement using fault diagnosis.
• The incremental agreement
• scientific article; zbMATH DE number 4058837

Cites work

• A distributed system-level diagnosis algorithm for arbitrary network topologies
• A Generalized Theory for System Level Diagnosis
• A New Algorithm for Generating Prime Implicants
• A New Technique for the Fast Minimization of Switching Functions
• A O(t/sup 3/+ mod E mod ) fault identification algorithm for diagnosable systems
• An 0(n^2.5) Fault Identification Algorithm for Diagnosable Systems
• Approximation Algorithms for the Set Covering and Vertex Cover Problems
• Consensus algorithms with one-bit messages
• Early consensus in an asynchronous system with a weak failure detector
• Efficient agreement using fault diagnosis.
• Efficient algorithms for finding maximum matching in graphs
• Fault identification in system-level diagnosis: A logic-based framework and an \(O(n^2\sqrt\tau / \sqrt{\log n)}\) algorithm
• Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds
• scientific article; zbMATH DE number 1304102 (Why is no real title available?)
• Modular construction of an efficient 1-bit Byzantine agreement protocol
• Optimal time Byzantine agreement for \(t<n/8\) with linear-messages
• Optimization of Reduced Dependencies for Synchronous Sequential Machines
• Reaching Agreement in the Presence of Faults
• Reaching approximate agreement in the presence of faults
• The broadcast comparison model for on-line fault diagnosis in multicomputer systems: theory and implementation
• The Byzantine Generals Problem
• The weakest failure detector for solving consensus
• Unreliable failure detectors for reliable distributed systems

Cited in

(3)

• Fault masking by multiple timing faults in timed EFSM models
• Performance study of Byzantine agreement protocol with artificial neural network
• Squeeziness: an information theoretic measure for avoiding fault masking

This page was built for publication: A flexible formal framework for masking/demasking faults

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