RT - Journal Article
T1 - Number of Minimal Path Sets in a Consecutive-k-out-of-n: F System
JF - srtc-jsri
YR - 2008
JO - srtc-jsri
VO - 4
IS - 2
UR - http://jsri.srtc.ac.ir/article-1-176-en.html
SP - 161
EP - 174
K1 - Minimal path set
K1 - consecutive-k-out-of-n: F system
K1 - generation function.
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.
LA eng
UL http://jsri.srtc.ac.ir/article-1-176-en.html
M3 10.18869/acadpub.jsri.4.2.161
ER -