Please use this identifier to cite or link to this item:
https://hdl.handle.net/11499/10773
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Tsarev, R.Y. | - |
dc.contributor.author | Durmuş, Mustafa Seçkin | - |
dc.contributor.author | Üstoglu, I. | - |
dc.contributor.author | Morozov, V.A. | - |
dc.date.accessioned | 2019-08-16T13:32:54Z | |
dc.date.available | 2019-08-16T13:32:54Z | |
dc.date.issued | 2018 | - |
dc.identifier.issn | 1742-6588 | - |
dc.identifier.uri | https://hdl.handle.net/11499/10773 | - |
dc.identifier.uri | https://doi.org/10.1088/1742-6596/1015/4/042059 | - |
dc.description.abstract | 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. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Institute of Physics Publishing | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.subject | Fault tolerance | en_US |
dc.subject | Information systems | en_US |
dc.subject | Redundancy | en_US |
dc.subject | Set theory | en_US |
dc.subject | Software reliability | en_US |
dc.subject | Common cause failure | en_US |
dc.subject | Consensus voting | en_US |
dc.subject | Equivalence relations | en_US |
dc.subject | Majority voting algorithm | en_US |
dc.subject | N version programming | en_US |
dc.subject | Software Specification | en_US |
dc.subject | Software versions | en_US |
dc.subject | Voting algorithm | en_US |
dc.subject | Application programs | en_US |
dc.title | Application of majority voting and consensus voting algorithms in N-version software | en_US |
dc.type | Conference Object | en_US |
dc.identifier.volume | 1015 | en_US |
dc.identifier.issue | 4 | en_US |
dc.identifier.doi | 10.1088/1742-6596/1015/4/042059 | - |
dc.relation.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
dc.identifier.scopus | 2-s2.0-85047746382 | en_US |
dc.identifier.wos | WOS:000446952000268 | en_US |
dc.identifier.scopusquality | - | - |
dc.owner | Pamukkale University | - |
item.grantfulltext | open | - |
item.fulltext | With Fulltext | - |
item.cerifentitytype | Publications | - |
item.openairetype | Conference Object | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.languageiso639-1 | en | - |
crisitem.author.dept | 10.04. Electrical-Electronics Engineering | - |
Appears in Collections: | Mühendislik Fakültesi Koleksiyonu Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection |
Files in This Item:
File | Size | Format | |
---|---|---|---|
Application of.pdf | 392.95 kB | Adobe PDF | View/Open |
CORE Recommender
SCOPUSTM
Citations
3
checked on Nov 16, 2024
WEB OF SCIENCETM
Citations
2
checked on Nov 21, 2024
Page view(s)
26
checked on Aug 24, 2024
Download(s)
30
checked on Aug 24, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.