+91 8617752708

British Journal of Mathematics & Computer Science, ISSN: 2231-0851,Vol.: 22, Issue.: 3

Original-research-article

Computation of k-out-of-n System Reliability via Reduced Ordered Binary Decision Diagrams

 

Ali Muhammad Ali Rushdi1 and Alaa Mohammad Alturki1*

1King Abdulaziz University, PO.Box 80204, Jeddah 21589, Saudi Arabia.

Article Information
Editor(s):
(1) Serkan Araci, Hasan Kalyoncu University, Turkey.
Reviewers:
(1) Abdullah Sonmezoglu, Bozok University, Turkey.
(2) Qingzhen Xu, South China Normal University, China.
(3) Sushil Ghimire, Kantipur Engineering College, Tribhuvan University, Nepal.
Complete Peer review History: http://www.sciencedomain.org/review-history/19261

Abstracts

A prominent reliability model is that of the partially-redundant (k-out-of-n) system. We use algebraic as well as signal-flow-graph methods to explore and expose the AR algorithm for computing k-out-of-n reliability. We demonstrate that the AR algorithm is, in fact, both a recursive and an iterative implementation of the strategy of Reduced Ordered Binary Decision Diagrams (ROBDDs). The underlying ROBDD for the AR recursive algorithm is represented by a compact Signal Flow Graph (SFG) that is used to deduce AR iterative algorithms of quadratic temporal complexity and linear spatial complexity. Extensions of the AR algorithm for (single or scalar) threshold, double-threshold, vector-threshold, and k-to-l-out-of-n systems have similar ROBDD interpretations.

Keywords :

AR algorithm; k-out-of-n system; reduced ordered binary decision diagram; reliability; signal flow graph.

Full Article - PDF    Page 1-9 Article Metrics

DOI : 10.9734/BJMCS/2017/33642

Review History    Comments

Our Contacts

Guest House Road, Street no - 1/6,
Hooghly, West Bengal,
India

+91 8617752708

 

Third Floor, 207 Regent Street
London, W1B 3HH,
UK

+44 20-3031-1429