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

Abstract

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 must be in state 1 for the system to be in state 1. This paper defines the multi-state k-out-of-n:G system: each component and the system can be in 1 of M+1 possible states: 0, 1, ..., M. In Case I, the system is in state ⩾j iff at least kj components are in state ⩾j. The value of kj I 1 can be different for different required minimum system-state level j. Examples illustrate applications of this definition. Algorithms for reliability evaluation of such systems are presented