| Raheja, D. G. Assurance Technologies: Principles and Practices. McGraw-Hill Engineering and Technology Management Series. McGraw-Hill, New York, 1991. |
....Tree Analysis used to model intrusions is a backward search. It begins with a known hazard (here, an intrusion) as the root node and traces back through the possible parallel and serial combinations of events that caused such an intrusion. Due to space limitations, the reader is referred to [15][20] for more precise descriptions of fault trees. The Saphire software from the Idaho National Engineering and Environmental Lab was used to draw and edit the fault trees. A cut set is a set of basic events whose occurrence causes the system to fail [20] A cut set is called a minimum cut set if it ....
....limitations, the reader is referred to [15] 20] for more precise descriptions of fault trees. The Saphire software from the Idaho National Engineering and Environmental Lab was used to draw and edit the fault trees. A cut set is a set of basic events whose occurrence causes the system to fail [20]. A cut set is called a minimum cut set if it cannot be reduced and can still cause the system to fail [20] A minimum cut of a fault tree gives a minimum set of successful events necessary to satisfy the root. Manian, et al. 18] use Binary Decision Diagrams as an alternative to cutset based ....
[Article contains additional citation context not shown here]
Raheja, D. G. Assurance Technologies: Principles and Practices. McGraw-Hill Engineering and Technology Management Series. McGraw-Hill, New York, 1991.
No context found.
Raheja, D. G. Assurance Technologies: Principles and Practices. McGraw-Hill Engineering and Technology Management Series. McGraw-Hill, New York, 1991.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC