AU - Khanjari Sadegh, Mohammad
AU - Moghaddaszadeh, Bagher
TI - Number of Minimal Path Sets in a Consecutive-k-out-of-n: F System
PT - JOURNAL ARTICLE
TA - srtc-jsri
JN - srtc-jsri
VO - 4
VI - 2
IP - 2
4099 - http://jsri.srtc.ac.ir/article-1-176-en.html
4100 - http://jsri.srtc.ac.ir/article-1-176-en.pdf
SO - srtc-jsri 2
ABĀ - In this paper the combinatorial problem of determining the number of minimal path sets of a consecutive-k-out-of-n: F system is considered. For the cases where k = 2, 3 the explicit formulae are given and for k ≥ 4 a recursive relation is obtained. Direct computation for determining the number of minimal path sets of a consecutive-k-out-of-n: F system for k ≥ 4 remains a difficult task.
CP - IRAN
IN -
LG - eng
PB - srtc-jsri
PG - 161
PT - Research
YR - 2008