Skip to content

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

Research output: Contribution to journalArticle

Original languageEnglish
Pages (from-to)82-88
Number of pages7
JournalPattern Recognition Letters
Volume102
Early online date19 Dec 2017
DOIs
DateAccepted/In press - 19 Dec 2017
DateE-pub ahead of print - 19 Dec 2017
DatePublished (current) - 15 Jan 2018

Abstract

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.

    Research areas

  • Algebraic reliability, Consecutive k-out-of-n, Hilbert series, k-out-of-n, Monomial ideals, Multi cuts, Multiple failures

Download statistics

No data available

Documents

Documents

  • Full-text PDF (accepted author manuscript)

    Rights statement: This is the accepted author manuscript (AAM). The final published version (version of record) is available online via Elsevier at https://doi.org/10.1016/j.patrec.2017.12.021 . Please refer to any applicable terms of use of the publisher.

    Accepted author manuscript, 293 KB, PDF document

    Licence: CC BY-NC-ND

DOI

View research connections

Related faculties, schools or groups