Fault-Tree Analysis Using a Binary Decision Tree
Copyright policy )Fault-Tree Analysis Using a Binary Decision Tree
Summary: A new algorithm for the production of a short disjoint-products form of a fault-tree output function is presented and discussed. This algorithm consists of a sequential binary decision process to find first big, then smaller sets of elementary system-failure states which correspond to disjoint-product terms. The identification of bad and good system states can be eased by a simple ternary (3-state) decision for which an auxiliary procedure is presented. The main advantages of this algorithm appear to be its efficiency, simplicity, and usefulness as an alternative (in the sense of multiversion programming for software fault tolerance) for the Shannon decomposition algorithm.
- University of Hagen Germany
ternary logic, fault-tree output function, Reliability, availability, maintenance, inspection in operations research, short disjoint-products form, sequential binary decision process
ternary logic, fault-tree output function, Reliability, availability, maintenance, inspection in operations research, short disjoint-products form, sequential binary decision process
citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).12 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!