On extreme disentanglement of clutters in the Polesskii estimates of the boundaries of combinatorial reliability of random binary systems

DOI10.1007/S10513-005-0188-9MaRDI QIDQ2457445zbMATH OpenOpenAlexFDO

Authors B. P. Filin

Publication date 23 October 2007

Published in Automation and Remote Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10513-005-0188-9

Mathematics Subject Classification ID

Reliability and life testing (62N05) Reliability, availability, maintenance, inspection in operations research (90B25)

Recommendations

• Clutter untypings, correlation inequalities, and bounds for combinatorial reliability.
• Reliability of binary systems
• Bounds on the reliability of binary coherent systems
• Polyhedral Combinatorics and Network Reliability
• On the synthesis of reliable probability networks

Cites work

• A method of rapid estimation of the reliability and the coefficient of potential structural invulnerability of links in complex systems
• An approach to calculating the probability of retaining the maximal flow
• Application of bipartite graphs to estimate the reliability of complex systems
• Calculating the operational availability factor of network systems
• Coherent Structures of Non-Identical Components
• Distribution series of the probability of existence of simple chains in a two-pole network
• Duality principle in the analysis of structural reliability of complex systems
• Guaranteed capacity of a two-pole network with unreliable elements: Probability computation
• scientific article; zbMATH DE number 4055539 (Why is no real title available?)
• scientific article; zbMATH DE number 710989 (Why is no real title available?)
• scientific article; zbMATH DE number 3363582 (Why is no real title available?)
• Reliability of double-pole networks with additive structures. II: Final probability of communication

Cited in

(1)

• Clutter untypings, correlation inequalities, and bounds for combinatorial reliability.

This page was built for publication: On extreme disentanglement of clutters in the Polesskii estimates of the boundaries of combinatorial reliability of random binary systems

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