New algorithm to reduce the number of computing steps in reliability formula of weighted-k-out-of-n system
In the disjoint products version of reliability analysis of weighted–k–out–of–n systems, it is necessary to determine the order in which the weight of components is to be considered. The k–out–of–n:G(F) system consists of n components; each com-ponent has its own probability and positive integer wei...
| Main Authors: | , , |
|---|---|
| Format: | Journal Article |
| Published: |
International Institute of Informatics and Cybernetics
2007
|
| Online Access: | http://www.iiisci.org/Journal/CV$/sci/pdfs/P390332.pdf http://hdl.handle.net/20.500.11937/28202 |
| _version_ | 1848752472731942912 |
|---|---|
| author | Higashiyama, Yoichi Ohkura, T. Rumchev, Ventseslav |
| author_facet | Higashiyama, Yoichi Ohkura, T. Rumchev, Ventseslav |
| author_sort | Higashiyama, Yoichi |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | In the disjoint products version of reliability analysis of weighted–k–out–of–n systems, it is necessary to determine the order in which the weight of components is to be considered. The k–out–of–n:G(F) system consists of n components; each com-ponent has its own probability and positive integer weight such that the system is operational (failed) if and only if the total weight of some operational (failure) components is at least k. This paper designs a method to compute the reliability in O(nk) computing time and in O(nk) memory space. The proposed method expresses the system reliability in fewer product terms than those already published. |
| first_indexed | 2025-11-14T08:09:10Z |
| format | Journal Article |
| id | curtin-20.500.11937-28202 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T08:09:10Z |
| publishDate | 2007 |
| publisher | International Institute of Informatics and Cybernetics |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-282022017-01-30T13:03:40Z New algorithm to reduce the number of computing steps in reliability formula of weighted-k-out-of-n system Higashiyama, Yoichi Ohkura, T. Rumchev, Ventseslav In the disjoint products version of reliability analysis of weighted–k–out–of–n systems, it is necessary to determine the order in which the weight of components is to be considered. The k–out–of–n:G(F) system consists of n components; each com-ponent has its own probability and positive integer weight such that the system is operational (failed) if and only if the total weight of some operational (failure) components is at least k. This paper designs a method to compute the reliability in O(nk) computing time and in O(nk) memory space. The proposed method expresses the system reliability in fewer product terms than those already published. 2007 Journal Article http://hdl.handle.net/20.500.11937/28202 http://www.iiisci.org/Journal/CV$/sci/pdfs/P390332.pdf International Institute of Informatics and Cybernetics restricted |
| spellingShingle | Higashiyama, Yoichi Ohkura, T. Rumchev, Ventseslav New algorithm to reduce the number of computing steps in reliability formula of weighted-k-out-of-n system |
| title | New algorithm to reduce the number of computing steps in reliability formula of weighted-k-out-of-n system |
| title_full | New algorithm to reduce the number of computing steps in reliability formula of weighted-k-out-of-n system |
| title_fullStr | New algorithm to reduce the number of computing steps in reliability formula of weighted-k-out-of-n system |
| title_full_unstemmed | New algorithm to reduce the number of computing steps in reliability formula of weighted-k-out-of-n system |
| title_short | New algorithm to reduce the number of computing steps in reliability formula of weighted-k-out-of-n system |
| title_sort | new algorithm to reduce the number of computing steps in reliability formula of weighted-k-out-of-n system |
| url | http://www.iiisci.org/Journal/CV$/sci/pdfs/P390332.pdf http://hdl.handle.net/20.500.11937/28202 |