Skip to main content

Quantification of Priority-OR Gates in Temporal Fault Trees

  • Conference paper
Computer Safety, Reliability, and Security (SAFECOMP 2012)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 7612))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Vesely, W.E., Stamatelatos, M., Dugan, J.B., et al.: Fault tree handbook with aerospace applications. NASA office of safety and mission assurance, Washington DC (2002)

    Google Scholar 

  2. Merle, G., Roussel, J.: Algebraic modelling of fault trees with priority AND gates. In: IFAC Workshop on Dependable Control of Discrete Systems, pp. 175–180 (2007)

    Google Scholar 

  3. Dugan, J.B., Bavuso, S.J., Boyd, M.A.: Dynamic fault-tree for fault-tolerant computer systems. IEEE Transactions on Reliability 41(3), 363–376 (1992)

    Article  MATH  Google Scholar 

  4. Merle, G.: Algebraic modelling of dynamic fault trees, contribution to qualitative and quantitative analysis. Dissertation, Décole Normale Supérieure De Cachan (2010)

    Google Scholar 

  5. Tang, Z., Dugan, J.B.: Minimal cut set/sequence generation for dynamic fault trees. In: Reliability And Maintainability Symposium (RAMS), Los Angeles, January 26-29 (2004)

    Google Scholar 

  6. Walker, M., Papadopoulos, Y.: Synthesis and analysis of temporal fault trees with PANDORA: The Time of Priority AND Gates. Nonlinear Analysis Hybrid Systems 2(2008), 368–382 (2006)

    MathSciNet  Google Scholar 

  7. Walker, M.D.: Pandora: A Logic for the Qualitative Analysis of Temporal Fault Trees. Dissertation. University of Hull (2009)

    Google Scholar 

  8. Fussel, J.B., Aber, E.F., Rahl, R.G.: On the quantitative analysis of Priority-AND failure logic. IEEE Transactions on Reliability R-25(5), 324–326 (1976)

    Article  Google Scholar 

  9. Walker, M., Papadopoulos, Y.: Qualitative Temporal Analysis: Towards a full implementation of the Fault Tree Handbook. Control Engineering Practice 17(2009), 1115–1125 (2008)

    Google Scholar 

  10. Vesely, W.E., Goldberg, F.F., Roberts, N.H., Haasl, D.F.: Fault Tree Handbook. US Nuclear Regulatory Commission, Washington, DC (1981)

    Google Scholar 

  11. Andrews, J.A.: To Not or Not to Not. In: Proceedings of the 18th International System Safety Conference, Fort Worth, pp. 267–275 (September 2000)

    Google Scholar 

  12. Sharvia, S., Papadopoulos, Y.: Non-coherent modelling in compositional fault tree analysis. In: The International Federation of Automatic Control, Seoul, July 6-11 (2008)

    Google Scholar 

  13. Esary, D., Proschan, F.: Coherent Structures with Non-Identical Components. Technometrics 5(2), 191–209 (1963)

    Article  MathSciNet  MATH  Google Scholar 

  14. Department of Defence, Military Handbook: electronic reliability design handbook, Webbooks (1998), http://webbooks.net/freestuff/mil-hdbk-338b.pdf (accessed June 27, 2011)

  15. Pukite, J., Pukite, P.: Modelling for reliability analysis. Wiley-IEEE Press, New York (1998)

    Book  Google Scholar 

  16. Weisstein, E.W.: Monte Carlo Method, MathWorld (2011), http://mathworld.wolfram.com/MonteCarloMethod.html (Accessed August 01, 2011)

  17. Rao, D.K., et al.: Dynamic fault tree analysis using Monte Carlo simulation in probabilistic safety assessment. Reliability Engineering and System Safety 94(4), 872–883 (2008)

    Google Scholar 

  18. Rocco, C.M., Muselli, M.: A machine learning algorithm to estimate minimal cut and path sets from a Monte Carlo simulation. In: Proceedings Probabilistic Safety Assessment and Management PSAM7/ESREL 2004, pp. 3142–3147. Springer, Berlin (2004)

    Google Scholar 

  19. Manian, R., Dugan, B.J., Coppit, D., Sullivan, K.J.: Combining various solution techniques for dynamic fault tree analysis of computer systems. In: Third IEEE International High-Assurance Systems Engineering Symposium, pp. 21–28. IEEE Computer Society (2002)

    Google Scholar 

  20. Isograph Limited, Reliability Workbench Version 11 User Guide, p. 392 (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Edifor, E., Walker, M., Gordon, N. (2012). Quantification of Priority-OR Gates in Temporal Fault Trees. In: Ortmeier, F., Daniel, P. (eds) Computer Safety, Reliability, and Security. SAFECOMP 2012. Lecture Notes in Computer Science, vol 7612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33678-2_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33678-2_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33677-5

  • Online ISBN: 978-3-642-33678-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics