2008
DOI: 10.1016/j.ress.2008.03.018
|View full text |Cite
|
Sign up to set email alerts
|

On the use of non-coherent fault trees in safety and security studies

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
14
0

Year Published

2011
2011
2024
2024

Publication Types

Select...
3
3
2

Relationship

0
8

Authors

Journals

citations
Cited by 30 publications
(14 citation statements)
references
References 21 publications
0
14
0
Order By: Relevance
“…For binary tree structures (fault and attack trees), BDD's have been applied to simplify the modeling threats on complex systems [1,4,5,17,18]. The common approach to determine probabilities on binary tree structures is to apply probability equations, such as those described in [6].…”
Section: Determining System Output Probabilitiesmentioning
confidence: 99%
See 1 more Smart Citation
“…For binary tree structures (fault and attack trees), BDD's have been applied to simplify the modeling threats on complex systems [1,4,5,17,18]. The common approach to determine probabilities on binary tree structures is to apply probability equations, such as those described in [6].…”
Section: Determining System Output Probabilitiesmentioning
confidence: 99%
“…Fault trees were originally developed to identify the effects of component failures on a system [16] while attack trees traditionally focused on the effects of cyber security breaches [14]. There have been recent variants of these trees, and sometimes these trees have been used interchangeably [2,5,6,7,11]. However, these trees all have one thing in common: they are binaryvalued trees, connected with AND and OR operators.…”
Section: Introductionmentioning
confidence: 99%
“…Clearly, the VOT(1) gate is equivalent to an OR-gate and a VOT(k) gate with k children is equivalent to an AND-gate. Sometimes other gates are considered, like the XOR (exclusive OR) and the NOT gate [2], [17]. Adding such gates makes fault trees non-coherent, i.e.…”
Section: Dfts: the General Recipementioning
confidence: 99%
“…These gates may yield noncoherent fault-trees [26]: an additional failed event may turn the system into an operational state again. As this seldomly occurs [17], a common approach (for SFTs) is to represent XOR elements by OR gates. Whereas this approach is guaranteed to under-approximate the system performance for SFTs, it may yield an over-approximation for DFTs.…”
Section: T(a) < T(b) T(a) = T(b) T(a) > T(b)mentioning
confidence: 99%
“…They may induce misleading results for non-coherent systems. Although fault trees are traditionally designed to be coherent, non-coherent fault trees have also been shown useful [41]. Fussell-Vesely is also unable to discriminate the aforementioned two cases: (i) low IB and high IC: The component needs to be improved and (ii) low IC and high IB: The structure function needs to be improved.…”
Section: Spectral Evaluation Of Fault Treesmentioning
confidence: 99%