Sentence examples for crash fault from inspiring English sources

Under arbitrary crash fault, we ensure that switching eventually terminates with the desired tree as the broadcast topology.

Note that this impossibility assumes the most "benign" type of fault, the crash fault, in which one process simply stops to produce any output given any input.

Idle: Malicious peers do not participate actively in the protocol, which amounts to a crash fault from the start of the protocol.

For example, it is common to have systems allowing crash fault tolerance with n≥f+1, while Byzantine fault tolerance usually requires n≥3f+1 [6, 18, 26].

We also investigate the specific delivery guarantees that can be provided when a single crash fault happens, both during switching and when no switching is in progress.

A fundamental theoretical result (often called FLP impossibility for the initials of the authors) states, informally, that no deterministic protocol can solve the consensus problem in the asynchronous communication model, even in the presence of only one crash fault [28].

For example, simple Crash fault-tolerant systems are often achieved with n=f+1, i.e., f=n−1.

For example: f=n−1 for some synchronous crash fault-tolerant (Crash FT) protocols (e.g., [19]); f=⌊(n−1)/2⌋ for some Byzantine fault-tolerant (BFT) systems with synchrony (e.g., [19]) or using trusted components (e.g., [7]); f=⌊(n−1)/3⌋ for general BFT systems (e.g., [6, 26]).

This protocol, called WSNDiag, is capable of diagnosing crash faults.

Crash faults are permanent and the faulty sensors can not do any kind of communication.

Most of the existing fault-tolerant strategies for these systems assume crash faults that are permanent events are easily detected.