Тип публикации: доклад, тезисы доклада, статья из сборника материалов конференций
Конференция: International Conference on Information Technologies in Business and Industry; Tomsk Polytechn Univ, Tomsk, RUSSIA; Tomsk Polytechn Univ, Tomsk, RUSSIA
Год издания: 2018
Идентификатор DOI: 10.1088/1742-6596/1015/4/042059
Аннотация: N-version programming is one of the most common techniques which is used to improve the reliability of software by building in fault tolerance, redundancy and decreasing common cause failures. N different equivalent software versions are developed by N different and isolated workgroups by considering the same software specifications. The versions solve the same task and return results that have to be compared to determine the correct result. Decisions of N different versions are evaluated by a voting algorithm or the so-called voter. In this paper, two of the most commonly used software voting algorithms such as the majority voting algorithm and the consensus voting algorithm are studied. The distinctive features of Nversion programming with majority voting and N-version programming with consensus voting are described. These two algorithms make a decision about the correct result on the base of the agreement matrix. However, if the equivalence relation on the agreement matrix is not satisfied it is impossible to make a decision. It is shown that the agreement matrix can be transformed into an appropriate form by using the Boolean compositions when the equivalence relation is satisfied. © Published under licence by IOP Publishing Ltd.
Журнал: Journal of Physics: Conference Series
Выпуск журнала: Vol. 1015, Is. 4
ISSN журнала: 17426588
Издатель: Institute of Physics Publishing
Информация о публикациях загружается с сайта службы поддержки публикационной активности СФУ. Сообщите, если заметили неточности.