Skip to main content

Quantification of priority-OR gates in temporal fault trees

Edifor, Ernest; Walker, Martin; Gordon, Neil

Authors

Ernest Edifor

Martin Walker



Abstract

Fault Tree Analysis has been used in reliability engineering for many decades and has seen various modifications to enable it to analyse fault trees with dynamic and temporal gates so it can incorporate sequential failure in its analysis. Pandora is a technique that analyses fault trees logically with three temporal gates (PAND, SAND, POR) in addition to Boolean gates. However, it needs extending so it can probabilistically analyse fault trees. In this paper, we present three techniques to probabilistically analyse one of its temporal gates - specifically the Priority-OR (POR) gate. We employ Monte Carlo simulation, Markov analysis and Pandora's own logical analysis in this solution. These techniques are evaluated and applied to a case study. All three techniques are shown to give essentially the same results.

Journal Article Type Conference Paper
Publication Date Oct 23, 2012
Journal Lecture Notes in Computer Science
Print ISSN 0302-9743
Electronic ISSN 1611-3349
Publisher Springer Verlag
Peer Reviewed Peer Reviewed
Volume 7612 LNCS
Pages 99-110
Book Title Lecture Notes in Computer Science; Computer Safety, Reliability, and Security
ISBN 9783642336775
APA6 Citation Edifor, E., Walker, M., & Gordon, N. (2012). Quantification of priority-OR gates in temporal fault trees. Lecture notes in computer science, 7612 LNCS, 99-110. https://doi.org/10.1007/978-3-642-33678-2_9
DOI https://doi.org/10.1007/978-3-642-33678-2_9
;