Difference between revisions of "Fault Tree"
Jump to navigation
Jump to search
| Line 17: | Line 17: | ||
===Standard Definition=== | ===Standard Definition=== | ||
| − | + | ====[[IETF]]==== | |
{{definition|A branching, hierarchical data structure that is used to represent events and to determine the various combinations of component failures and human acts that could result in a specified undesirable system [[event]]. <ref name="IETFrefs">[https://tools.ietf.org/html/rfc4949 IETF RFC449 Internet Security Glossary 2]</ref>}}<br /> | {{definition|A branching, hierarchical data structure that is used to represent events and to determine the various combinations of component failures and human acts that could result in a specified undesirable system [[event]]. <ref name="IETFrefs">[https://tools.ietf.org/html/rfc4949 IETF RFC449 Internet Security Glossary 2]</ref>}}<br /> | ||
Revision as of 17:59, 7 February 2016
Contents
Definitions
European Definitions
DIESIS project
The DIESIS project [1] gives the following definition:
Fault trees represent fault sequences of components in which each component is logically decomposed into sub-components (CXX). In a Fault Tree, leaves represent failures of sub-components (fault causes), and the logical nodes are the faults (consequences) of the components.
Other International Definitions
National Definitions
United States
Fault tree is a graphical tool used to illustrate the range, probability, and interaction of causal occurrences that lead to a final outcome. [2]
Standard Definition
IETF
A branching, hierarchical data structure that is used to represent events and to determine the various combinations of component failures and human acts that could result in a specified undesirable system event. [3]
