@ARTICLE{Khanjari Sadegh,
author = {Khanjari Sadegh, Mohammad and Moghaddaszadeh, Bagher and },
title = {Number of Minimal Path Sets in a Consecutive-k-out-of-n: F System},
volume = {4},
number = {2},
abstract ={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. },
URL = {http://jsri.srtc.ac.ir/article-1-176-en.html},
eprint = {http://jsri.srtc.ac.ir/article-1-176-en.pdf},
journal = {Journal of Statistical Research of Iran},
doi = {10.18869/acadpub.jsri.4.2.161},
year = {2008}
}