Efficient multicut enumeration of k-out-of-n:F and consecutive\n k-out-of-n:F systems

2017/12/21 by Fatemeh Mohammadi, Mohammadi, Fatemeh, Eduardo Sáenz‐de‐Cabezón +3 · 1 citation
Computer Science · Engineering · #Coding theory and cryptography #Commutative Algebra (math.AC) #FOS: Mathematics #Probability (math.PR) #Reliability and Maintenance Optimization #Software Reliability and Analysis Research

paper · pdf · doi:10.48550/arxiv.1712.08042

openalex publication_date 2017/12/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We study multiple simultaneous cut events for k-out-of-n:F and linear\nconsecutive k-out-of-n:F systems in which each component has a constant failure\nprobability. We list the multicuts of these systems and describe the structural\ndifferences between them. Our approach, based on combinatorial commutative\nalgebra, allows complete enumeration of the sets of multicuts for both kinds of\nsystems. We also analyze the computational issues of multicut enumeration and\nreliability computations.\n

Cited by

• Redundancy analysis using lcm-filtrations: networks, system signature and sensitivity evaluation

Related

• Using GENERATINGFUNCTIONOLOGY to Enumerate Distinct-Multiplicity Partitions
• Multicut is FPT
• The Enumeration of Permutations With a Prescribed Number of ``Forbidden'' Patterns
• Automatic Generation of Theorems and Proofs on Enumerating Consecutive-Wilf classes
• Linear-Time and Constant-Space Algorithms to compute Multi-Sequences that arise in Enumerative Combinatorics (and Elsewhere)