Abstract
This paper proposes a new method for fault-tree probabilities evaluation. The method is based on Shanon's factorization of boolean binary functions using the repeated basic events as pivot. Examples taken from the literature are used to show the efficiency of our method in comparison with other methods.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
K.K. Lee, “A compilation technique for exact system reliability”. IEEE Trans. Reliab., Vol R-30, 1981 Aug, pp. 284–288.
N. Limnios “Arbres de défaillance”, Editions Hermes, 1991.
M. Modarres, H. Dezfuli, “A truncation methodology for evaluating large fault trees”, IEEE Trans. Reliab., Vol. R-33, 1984 Oct., pp 325–328.
L.B. Page, J.E. Perry, “An algorithm for exact fault-tree probabilities without cut sets”, IEEE Trans. Reliab. Vol. R-35, No 5, Dec. 1986, pp. 544–558.
W.G. Shneeweiss, “Disjooint boolean product via Shanon's expansion”, IEEE Trans. Reliab. Vol. R-33, No4, Oct. 1984, pp. 329–332.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag
About this paper
Cite this paper
Odeh, K., Limnios, N. (1994). An efficient method for probability evaluation of a fault-tree. In: Henry, J., Yvon, JP. (eds) System Modelling and Optimization. Lecture Notes in Control and Information Sciences, vol 197. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035544
Download citation
DOI: https://doi.org/10.1007/BFb0035544
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19893-2
Online ISBN: 978-3-540-39337-5
eBook Packages: Springer Book Archive