An algorithm for fault-tree probabilities using the factoring theorem
- 1 January 1988
- journal article
- Published by Elsevier in Microelectronics Reliability
- Vol. 28 (2) , 273-286
- https://doi.org/10.1016/0026-2714(88)90361-7
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A practical implementation of the factoring theorem for network reliabilityIEEE Transactions on Reliability, 1988
- Factoring Algorithms for Computing K-Terminal Network ReliabilityIEEE Transactions on Reliability, 1986
- A simple approach to fault-tree probabilitiesComputers & Chemical Engineering, 1986
- An Algorithm for Exact Fault-Tree Probabilities without Cut SetsIEEE Transactions on Reliability, 1986
- Network reliability and acyclic orientationsNetworks, 1984
- FTANS¿A Computer Program for Probabilistic Analysis of Non-Coherent StructuresIEEE Transactions on Reliability, 1984
- Network reliability and the factoring theoremNetworks, 1983
- ESCAFߝA New and Cheap System for Complex Reliability Analysis and ComputationIEEE Transactions on Reliability, 1982
- Dagger-Sampling Monte Carlo For System Unavailability EvaluationIEEE Transactions on Reliability, 1980
- Fault Trees, Prime Implicants, and NoncoherenceIEEE Transactions on Reliability, 1980