1989
DOI: 10.1109/32.41339
|View full text |Cite
|
Sign up to set email alerts
|

The consistent comparison problem in N-version software

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
10
0

Year Published

1992
1992
2013
2013

Publication Types

Select...
5
5

Relationship

0
10

Authors

Journals

citations
Cited by 57 publications
(10 citation statements)
references
References 2 publications
0
10
0
Order By: Relevance
“…where all nonfaulty replicates produce bitwise-identical output, particularly when output is generated at high frequencies [13]. However, in some systems non-faulty replicates might produce slightly different values [7]. For example, replicates might use data from different sensors or a different calculation algorithm.…”
Section: Related Workmentioning
confidence: 98%
“…where all nonfaulty replicates produce bitwise-identical output, particularly when output is generated at high frequencies [13]. However, in some systems non-faulty replicates might produce slightly different values [7]. For example, replicates might use data from different sensors or a different calculation algorithm.…”
Section: Related Workmentioning
confidence: 98%
“…In particular, the system becomes subject to a variation of the consistent comparison problem raised in [14]. Consider a system with three instances, π 1 , π 2 and π 3 which, for a given input value x, produce three traces σ 1 , σ 2 and σ 3 respectively.…”
Section: B Multiple Instancesmentioning
confidence: 99%
“…Replicated nodes' output values can vary slightly, resulting in a range (or a set) of values which should be considered as correct to avoid consistency issues [5], later addressed by inexact voting strategies [14]. This phenomenon is also observed in the time domain due to, e.g., clock drifts, node failures, processing and scheduling variations at node level, and communication delays.…”
Section: Introductionmentioning
confidence: 96%