ABSTRACT
Markov Chain method for Dynamic Fault Tree with reparable components is discussed. The complexity of the problem and definition of dynamic gates is considered. Significant simplification of the method is suggested based on joining and truncation of Markov Chain states. The accuracy of approximation is based on assumption that Mean Time to Repair is much less than Mean Time to Failure. Several examples are studied.
