An Algorithm for Obtaining Simplified Prime Implicant Sets in Fault-Tree and Event-Tree Analysis

DOI10.1109/TR.1983.5221693MaRDI QIDQ3323672zbMATH OpenOpenAlexFDO

Authors Kazuo Takaragi, Ryoichi Sasaki, Sadanori Shingai

Publication date 1983

Published in IEEE Transactions on Reliability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tr.1983.5221693

zbMATH Keywords

accident sequenceapproximate probability calculationsAsymptotic convergenceevent treesminimal cut setnon-coherent fault treeprime implicant set

Mathematics Subject Classification ID

Logical aspects of Boolean algebras (03G05) Reliability, availability, maintenance, inspection in operations research (90B25)

Recommendations

• Prime Implicants of Noncoherent Fault Trees
• scientific article; zbMATH DE number 3987015
• An Algorithm for Reducing Cut Sets in Fault-Tree Analysis
• A Truncation Methodology for Evaluating Large Fault Trees
• Approximate Fault-Tree Analysis with Prescribed Accuracy

Cited in

(5)

• scientific article; zbMATH DE number 3898592 (Why is no real title available?)
• scientific article; zbMATH DE number 3915998 (Why is no real title available?)
• Multiple-Valued Logic Trees: Meaning and Prime Implicants
• An Algorithm for Reducing Cut Sets in Fault-Tree Analysis
• Prime Implicants of Noncoherent Fault Trees

This page was built for publication: An Algorithm for Obtaining Simplified Prime Implicant Sets in Fault-Tree and Event-Tree Analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3323672)