Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Gupta et al. (1979) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: