City Research Online

Proofs of Conservative Confidence Bounds on PFD, Using Claims of Improved Reliability

Salako, K. ORCID: 0000-0003-0394-7833, Strigini, L. ORCID: 0000-0002-4246-2866 and Zhao, X. (2021). Proofs of Conservative Confidence Bounds on PFD, Using Claims of Improved Reliability. .

Abstract

We derive infima for posterior confidence in bounds on system pfd, subject to various constraints – called “prior knowledge” – on joint prior distributions. This concerns confidence bounds on the pfd for a system B, upon observing two systems, A and B, operate without failure. In particular, the results hold when evidence supports a claim of B being as reliable, or better, than A. The propositions proved in this technical report are motivated, explained and discussed in the paper “Conservative Confidence Bounds in Safety, from Generalised Claims of Improvement & Statistical Evidence”, reported at the 51st IEEE/IFIP DSN conference

Publication Type: Report
Additional Information: The propositions proved in this technical report are motivated, explained and discussed (with numerical examples) in the paper "Conservative Confidence Bounds in Safety, from Generalised Claims of Improvement & Statistical Evidence", reported at the 51st IEEE/IFIP DSN conference.
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Departments: School of Mathematics, Computer Science & Engineering > Computer Science > Software Reliability
Date Deposited: 13 Apr 2021 09:21
URI: https://openaccess.city.ac.uk/id/eprint/25905
[img]
Preview
Text - Draft Version
Download (675kB) | Preview

Export

Downloads

Downloads per month over past year

View more statistics

Actions (login required)

Admin Login Admin Login