%0 Journal Article
%A Khanjari Sadegh, Mohammad
%A Moghaddaszadeh, Bagher
%T Number of Minimal Path Sets in a Consecutive-k-out-of-n: F System
%J Journal of Statistical Research of Iran
%V 4
%N 2
%U http://jsri.srtc.ac.ir/article-1-176-en.html
%R 10.18869/acadpub.jsri.4.2.161
%D 2008
%K Minimal path set, consecutive-k-out-of-n: F system, generation function.,
%X 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.
%> http://jsri.srtc.ac.ir/article-1-176-en.pdf
%P 161-174
%& 161
%!
%9 Research
%L A-10-1-145
%+
%G eng
%@ 1735-1294
%[ 2008