An Approximate Algorithm for Top-Event Occurrence Rate of Dynamic Fault Trees

Zhou Zhong-bao · 2006

This paper introduces an approximate algorithm for top-event occurrence rate of dynamic fault trees. The method need not convert dynamic fault trees to Markov chains,but analyzes dynamic modules directly,and obtain approximate numerical solution using trapezoid formula. The validity of the method is proved by an example.

Read the paper · More papers on PaperTik