Proceedings of the Twenty-Fourth Annual Hawaii International Conference on System Sciences
DOI: 10.1109/hicss.1991.183986
|View full text |Cite
|
Sign up to set email alerts
|

A comparison of voting algorithms for n-version programming

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0
1

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 17 publications
(6 citation statements)
references
References 14 publications
0
5
0
1
Order By: Relevance
“…Gersting et al in [9], proposed a majority voter which considers history record of each module as cumulative number of times it is participated in majority agreement in all previous voting cycles. If there is no agreement between results of the modules, this voter chooses the output of the module that has the highest history record.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Gersting et al in [9], proposed a majority voter which considers history record of each module as cumulative number of times it is participated in majority agreement in all previous voting cycles. If there is no agreement between results of the modules, this voter chooses the output of the module that has the highest history record.…”
Section: Related Workmentioning
confidence: 99%
“…Many voting techniques have been proposed in the literature, see [5], [6] and [9], from which the majority voter and its modified versions have been widely used. A majority voter with n inputs produces result if and only if there is an agreement between at least [(n +1)/2] of its inputs.…”
Section: Figure 1 a Tmr Voter [5]mentioning
confidence: 99%
“…For improving of voting algorithms stability to the related faults of program modules [1], in comparison with unweighted analogs, are suggested the modifications of the basic voting algorithms agreed by a majority and a fuzzy vote by an agreed majority [2].…”
Section: Voting Algorithmsmentioning
confidence: 99%
“…The voter receives outputs of N-different modules and compares them depending on the voting strategy. Several voting algorithms (or strategies) and their comparisons can be found in the literature [11][12][13][14][15][16][17][18].…”
Section: Introductionmentioning
confidence: 99%
“…If the safe-state of the system is not determined (or if the system is not fail-safe), generalized voting strategies [11,12] can be used, where generally N is chosen as 3 (triple modular redundancy (TMR)) [19][20][21]. A possible TMR architecture is illustrated in Figure 1.…”
Section: Introductionmentioning
confidence: 99%