A flexible formal framework for masking/demasking faults
type: Item
instance of: scholarly article
title: A flexible formal framework for masking/demasking faults
zbMATH Open document ID: 1076.68015
author: Yanyan Li
published in: Information Sciences
publication date: 2004-08-06T00:00:00Z
Mathematics Subject Classification ID: 68M15
Mathematics Subject Classification ID: 68M14
zbMATH DE Number: 2082197
zbMATH Keywords: Fault identification
zbMATH Keywords: Byzantine problems
zbMATH Keywords: Global agreement
zbMATH Keywords: Distributed systems
zbMATH Keywords: Masking vs. identifying faults
MaRDI profile type: Publication
full work available at URL: j.ins.2003.03.004
OpenAlex ID: W2047903207
cites work: Q4250796
cites work: Fault identification in system-level diagnosis: A logic-based framework and an \(O(n^2\sqrt\tau / \sqrt{\log n)}\) algorithm
cites work: Consensus algorithms with one-bit messages
cites work: The broadcast comparison model for on-line fault diagnosis in multicomputer systems: theory and implementation
cites work: The weakest failure detector for solving consensus
cites work: Unreliable failure detectors for reliable distributed systems
cites work: Efficient agreement using fault diagnosis.
cites work: Modular construction of an efficient 1-bit Byzantine agreement protocol
cites work: An 0(n2.5) Fault Identification Algorithm for Diagnosable Systems
cites work: Reaching approximate agreement in the presence of faults
cites work: Optimization of Reduced Dependencies for Synchronous Sequential Machines
cites work: Efficient algorithms for finding maximum matching in graphs
cites work: Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds
cites work: Approximation Algorithms for the Set Covering and Vertex Cover Problems
cites work: Reaching Agreement in the Presence of Faults
cites work: The Byzantine Generals Problem
cites work: A distributed system-level diagnosis algorithm for arbitrary network topologies
cites work: A New Technique for the Fast Minimization of Switching Functions
cites work: Early consensus in an asynchronous system with a weak failure detector
cites work: A New Algorithm for Generating Prime Implicants
cites work: A Generalized Theory for System Level Diagnosis
cites work: A O(t/sup 3/+ mod E mod ) fault identification algorithm for diagnosable systems
cites work: Optimal time byzantine agreement for t <n/8 with linear-messages
DOI: 10.1016/J.INS.2003.03.004
description: scientific article; zbMATH DE number 2082197