scientific article; zbMATH DE number 4012285

zbMATH Open0623.90024MaRDI QIDQ3762048FDOQ3762048

Authors: Frank Beichelt, Lutz Spross 

Publication date: 1987

Title of this publication is not available (Why is that?)

Recommendations

• Combinatorial-graphic method of reliability analysis of complex systems with monotone Boolean functions
• Bounds on the reliability of binary coherent systems
• scientific article; zbMATH DE number 799619
• Eine Zerlegungsformel für die Zuverlässigkeit komplizierter technischer Systeme/ A decomposition formula for determining the reliability of complex technical systems
• Computational Complexity of Coherent Systems and the Reliability Polynomial

zbMATH Keywords

network reliabilitybinary coherent systemAbraham algorithmlogical union of products of Boolean variablesunion of disjoint products

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Applications of graph theory to circuits and networks (94C15)

Cited In (8)

• Approximate method to evaluate reliability of complex networks
• An Efficient Sequential Reliability Analysis Method for Multidisciplinary System
• Reliability analysis of a complex one unit system
• Efficient method for calculation of system reliability of a complex structure
• Simulation methods for reliability and availability of complex systems
• Reliability coefficient of star complex system
• Computational Complexity of Coherent Systems and the Reliability Polynomial
• Reliability Analysis for a Real Non-Coherent System

This page was built for publication:

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