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

A conservative bound for the probability of failure of a 1-out-of-2 protection system with one hardware-only and one software-based protection train

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
4
1
1

Relationship

1
5

Authors

Journals

citations
Cited by 8 publications
(7 citation statements)
references
References 9 publications
0
7
0
Order By: Relevance
“…Due to the unknown ground truth over the underlying data distribution, this approach usually requires to either make an assumption over the distribution [22] or learn the distribution [26]. Note that, the obtained probabilistic assessment can be bounded [2,12]. One step further, it might be interesting to understand, and verify, the safety and reliability issues in learning-enabled autonomous systems where deep learning components interact with symbolic or probabilistic components [9,20].…”
Section: Probabilistic Assessment and Safety Argumentmentioning
confidence: 99%
“…Due to the unknown ground truth over the underlying data distribution, this approach usually requires to either make an assumption over the distribution [22] or learn the distribution [26]. Note that, the obtained probabilistic assessment can be bounded [2,12]. One step further, it might be interesting to understand, and verify, the safety and reliability issues in learning-enabled autonomous systems where deep learning components interact with symbolic or probabilistic components [9,20].…”
Section: Probabilistic Assessment and Safety Argumentmentioning
confidence: 99%
“…Appendix A.1 shows that there is a conservative, linear approximation to the confidence region, D 1 , that can be used to derive an analytic upper bound q u > q s based on the bin-filling algorithm reported in [20,21]. This analysis shows that the upper bound q u can always be obtained by assigning all the failure probability to the cutset with the smallest total of component tests.…”
Section: Structure-based Confidence Bound Modelmentioning
confidence: 99%
“…Since equation (A.5) is linear, finding the conservative confidence bound (A.6) is a linear programming problem, which can be solved with the bin-filling algorithm, reported in [20,21]:…”
Section: Appendix a Confidence Bound Approximationmentioning
confidence: 99%
“…Recent work has estimated a conservative bound for the failure probability of a program-pair in a special case [36,37], but a general solutions are not available The EL and LM models attempt to describe what is true 'on average' for a large population of programs. Subsequently, an online collection of programs has been used for demonstrating the LM model [21].…”
Section: Safety Integrity Levelmentioning
confidence: 99%