A Method of Symbolic Steady-State Availability Evaluation of k-out-of-n:G System

This paper presents a method for computing the symbolic steady-state (s.s.) availability of a k-out-of-n:G system which can be represented by a Markov process with constant transition rates. Units have 3 states. The method is particularly suitable when s.s. availability must be evaluated repeatedly for the fixed configuration and several transition rates.