Abstract
A new method is proposed to select the binary n-tuples of 0s and 1s by decreasing order of there occurrence probabilities in stochastic Boolean models. This method can be applied to evaluate fault trees in Reliability Engineering and Risk Analysis, as well as to many other problems described by a stochastic Boolean structure. The selecting criterion is exclusively based on the positions of 0s and 1s in the binary n-tuples. In this way, the computational cost in sorting algorithms is drastically reduced, because the proposed criterion is independent of the probabilities of the Boolean variables. Every step, the algorithm extends the set of selected binary states, obtaining the binary n-tuples just by adding 0 (1) at the end of all the (some) previously selected binary n — 1-tuples.
Partially supported by MCYT, Spain. Grant contract: REN2001-0925-C03-02/CLI
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Coudert, O., Madre, J.C.: Metaprime: An Interactive Fault-Tree Analyzer. IEEE Trans. Reliability 43(1) (1994) 121–127
Fussell, J.B.: A Formal Methodology for Fault-Tree Construction. Nuclear Ebg. And Design 52 (1973) 337–360
Galván, B.J., García, D., González, L.: Un Método Determinista para la Evaluación de Funciones Booleanas Estocásticas: Análisis Comparativo. In: Font, J., Jorba, A. (eds.): Proc. XIV CEDYA-IV CMA. Barcelona (1995) 257–258
González, L., García, D., Galván, B.J.: An Intrinsic Order Criterion to Evaluate Large, Complex Fault Trees. IEEE Trans. Reliability, to appear.
Kumamoto, H., Henley, E.: Top-Down Algorithm for Obtaining Prime Implicants Sets on Non Coherent Fault Trees. IEEE Trans. Reliability 27(4) (1978) 242–249
Kumamoto, H., Tanaka, T., Inoue, K., Henley, E.: Dagger Sampling Montecarlo for System Unavailability Evaluation. IEEE Trans. Reliability 29(2) (1980) 122–125
Page, L.B., Perry, J.E.: Direct Evaluation Algorithms for Fault-Tree Probabilities. Computers in Chemical Engineering 15(3) (1991) 157–169
Rai, S.: A Direct Approach to Obtain Tighter Bounds for Large Fault Trees with Repeated Events. In: Evans Associates (eds.): Proc. Annual. Rel.& Maint. Symposium, Vol. 23. North Carolina (1994) 475–480
Schneeweiss, W.G.: Boolean Functions with Engineering Applications and Computer Programs. Springer-Verlag, Berlin Heidelberg New York (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
González, L. (2002). A New Method for Ordering Binary States Probabilities in Reliability and Risk Analysis. In: Sloot, P.M.A., Hoekstra, A.G., Tan, C.J.K., Dongarra, J.J. (eds) Computational Science — ICCS 2002. ICCS 2002. Lecture Notes in Computer Science, vol 2329. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46043-8_13
Download citation
DOI: https://doi.org/10.1007/3-540-46043-8_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43591-4
Online ISBN: 978-3-540-46043-5
eBook Packages: Springer Book Archive