Modularizing, Minimizing, and Interpreting the K&H Fault-Tree
- 1 December 1981
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Reliability
- Vol. R-30 (5) , 411-415
- https://doi.org/10.1109/TR.1981.5221150
Abstract
The verification by Worrell & Stack (W&S) of results previously obtained by Kumamoto & Henley (K&H) for a fault tree of an s-noncoherent system and its inverse and their correction of the three errors in the tree makes it possible to simplify the analysis by forming modules; this facilitates Boolean algebraic operations, so that both sets are described economically in their minimal forms, a subset of the prime implicants (p.i.'s). Quine's consensus operation is used to minimize and to find the p.i.'s. Corresponding to the MOCUS output for the inverse reported by K&H, which is neither minimal nor the set of p.i.'s, instead of 32 terms, there are 15 in the modularized set. Instead of the 42 p.i.'s obtained by both K&H and W&S, we have 17; 13 of these are a unique minimal form. Instead of 352 p.i.'s for the tree per both K&H and W&S, we have a 15-term minimal form, identical to the list of p.i.'s. The results are further analyzed as a contribution to the continuing discussion of the utility of minimal forms vis-a-vis the p.i.'s and of the consensus method.Keywords
This publication has 12 references indexed in Scilit:
- Prime Implicants of Noncoherent Fault TreesIEEE Transactions on Reliability, 1981
- Decomposition Methods for Fault Tree AnalysisIEEE Transactions on Reliability, 1980
- Fault Trees, Prime Implicants, and NoncoherenceIEEE Transactions on Reliability, 1980
- The Fail-Safe Feature of the Lapp & Powers Fault TreeIEEE Transactions on Reliability, 1980
- Inverting and Minimizing Boolean Functions, Minimal Paths and Minimal Cuts: Noncoherent System AnalysisIEEE Transactions on Reliability, 1979
- Synthesis of Fault Trees: An Example of NoncoherenceIEEE Transactions on Reliability, 1979
- Update of Lapp-Powers Fault-Tree Synthesis AlgorithmIEEE Transactions on Reliability, 1979
- Comments on the Lapp - Powers "Computer-Aided Synthesis of Fault TreesIEEE Transactions on Reliability, 1979
- Top-down Algorithm for Obtaining Prime Implicant Sets of Non-Coherent Fault TreesIEEE Transactions on Reliability, 1978
- Computer-aided Synthesis of Fault-treesIEEE Transactions on Reliability, 1977