Reliability of Systems with Consecutive Minimal Cutsets
From MaRDI portal
Recommendations
- The reliability of systems with stair-type consecutive minimal cuts
- Counting almost minimum cutsets with reliability applications
- scientific article; zbMATH DE number 1154601
- Bounding network-reliability using consecutive minimal cutsets
- scientific article; zbMATH DE number 1576829
- On the reliability of generalized consecutive systems
- On the Reliability of an n-Component System
- Reliability evaluation of a limited-flow network in terms of minimal cutsets
Cited in
(13)- Reliability bounds for coherent structures with independent components
- Optimal allocation of multi-state elements in linear consecutively connected systems with vulnerable nodes.
- Evaluation of reliability bounds by set covering models.
- On the domination of hypergraphs by their edges
- A minimal-automaton-based algorithm for the reliability of Con\((d,k,n)\) systems
- Bounds for coherent reliability structures
- m/nCCS: linear consecutively connected systems subject to combined gap constraints
- The reliability of systems with stair-type consecutive minimal cuts
- Minset Splitting for Improved Reliability Computation
- An Algorithm for Symbolic Reliability Computation with Path-sets or Cut-sets
- Bounding network-reliability using consecutive minimal cutsets
- An explicit solution for the number of minimal p-cutsequences in a consecutive-k-out of-n:F system
- Reliability of binary systems
This page was built for publication: Reliability of Systems with Consecutive Minimal Cutsets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3777782)
