A Simple Tighter Upper Bound for the Probability of a Union of Events; with Dependability Applications
It is shown that with a very small computational overhead the error interval between the first two Bonferroni inequalities can be reduced, thus allowing for very much simpler approximate analysis of mincut-based fault trees in many cases than by Hunter's tighter upper bound. Details of an improved approximate fault tree analysis are given for the determination of system unavailability. Some hints are given for improving, in a similar way, the approximate determination of i) mean life of non-repaired electronics systems and ii) mean system failure frequency.
Nutzung und Vervielfältigung:
Alle Rechte vorbehalten