A flexible formal framework for masking/demasking faults

DOI10.1016/j.ins.2003.03.004zbMath1076.68015OpenAlexW2047903207MaRDI QIDQ1827146

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

Distributed systemsFault identificationByzantine problemsGlobal agreementMasking vs. identifying faults

Mathematics Subject Classification ID

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

Related Items (1)

Performance study of Byzantine agreement protocol with artificial neural network

Cites Work

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

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