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

Mohammadi, Fatemeh, Saenz-de-Cabezon, Eduardo and Wynn, Henry P. ORCID: 0000-0002-6448-1080 (2018) Efficient multicut enumeration of k -out-of- n:F and consecutive k -out-of- n:F systems. Pattern Recognition Letters, 102. pp. 82-88. ISSN 0167-8655

Preview

Text - Accepted Version Download (404kB) | Preview

• Author

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

Item Type:	Article
Official URL:	http://www.sciencedirect.com/science/journal/01678...
Additional Information:	© 2017 Elsevier B.V.
Divisions:	Statistics
Subjects:	H Social Sciences > HA Statistics
Date Deposited:	16 Jan 2018 15:20
Last Modified:	02 Nov 2024 20:33
URI:	http://eprints.lse.ac.uk/id/eprint/86460

Actions (login required)

View Item