Editing Byzantine fault (section)

=== Applications in computing ===
Byzantine fault tolerance mechanisms use components that repeat an incoming message (or just its signature, which can be reduced to just a single bit of information if self-checking pairs are used for nodes) to other recipients of that incoming message. All these mechanisms make the assumption that the act of repeating a message blocks the propagation of Byzantine symptoms. For systems that have a high degree of safety or security criticality, these assumptions must be proven to be true to an acceptable level of [[fault coverage]]. When providing proof through testing, one difficulty is creating a sufficiently wide range of signals with Byzantine symptoms.<ref name="NanyaGoosen1989">{{cite journal |last1=Nanya |first1=T. |last2=Goosen |first2=H.A. |year=1989 |title=The Byzantine hardware fault model |journal=IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems |volume=8 |issue=11 |pages=1226–1231 |doi=10.1109/43.41508 |issn=0278-0070}}</ref> Such testing will likely require specialized [[Fault injection|fault injectors]].<ref name="MartinsGandhi2013">{{cite book |last1=Martins |first1=Rolando |title=Middleware 2013 |last2=Gandhi |first2=Rajeev |last3=Narasimhan |first3=Priya |last4=Pertet |first4=Soila |last5=Casimiro |first5=António |last6=Kreutz |first6=Diego |last7=Veríssimo |first7=Paulo |year=2013 |isbn=978-3-642-45064-8 |series=Lecture Notes in Computer Science |volume=8275 |pages=41–61 |chapter=Experiences with Fault-Injection in a Byzantine Fault-Tolerant Protocol |doi=10.1007/978-3-642-45065-5_3 |issn=0302-9743 |s2cid=31337539}}</ref><ref>{{cite patent|country=US|number=7475318|title=Method for testing the sensitive input range of Byzantine filters|status=patent|fdate=2006-01-27|pridate=2005-01-28|gdate=2009-01-06|inventor=Kevin R. Driscoll|assign1=Honeywell International Inc.}}</ref>