Generalized multi-state k-out-of-n : G systems

In a binary k-out-of-n:G system, k is the minimum number of components that must work for the system to work. Let 1 represent the working state and 0 the failure state, k then indicates the minimum number of components that m ust be in state 1 for the system to be in state 1, This paper defines the m ulti-state k-out-of-n:G system: each component and the system can be in 1 o f M + 1 possible states: 0, 1,...,M. Case I, the system is in state greater than or equal to j iff at least k(j) components are in state greater than or equal to j. The value of k(j) can be different for different required mi nimum system-state level j, Examples illustrate applications of this defini tion, Algorithms for reliability evaluation of such systems are presented.