Efficient multicut enumeration of k -out-of- n:F and consecutive k -out-of- n:F systems
Mohammadi, F., Saenz-de-Cabezon, E. & Wynn, H. P.
(2018).
Efficient multicut enumeration of k -out-of- n:F and consecutive k -out-of- n:F systems.
Pattern Recognition Letters,
102, 82-88.
https://doi.org/10.1016/j.patrec.2017.12.021
(2018).
Efficient multicut enumeration of k -out-of- n:F and consecutive k -out-of- n:F systems.
Pattern Recognition Letters,
102, 82-88.
https://doi.org/10.1016/j.patrec.2017.12.021
We study multiple simultaneous cut events for k-out-of-n:F and linear consecutive k-out-of-n:F systems in which each component has a constant failure probability. We list the multicuts of these systems and describe the structural differences between them. Our approach, based on combinatorial commutative algebra, allows complete enumeration of the sets of multicuts for both kinds of systems. We also analyze the computational issues of multicut enumeration and reliability computations