Metraipolis › archive › dc_cbec263270e6
Per-State Signatures and Mean Time-to-Failure: An Algorithm for Systems With Simultaneous Failures — arXiv:2610.22181
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.22181
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T10:29:00.369Z
- SHA-256 of the archived text
c491032e6b9a83eb562c8247100fa6bc14fab96bc7a29cd907e418ced9db3f18- Stable URL of this page
https://metraipolis.com/documento/dc_cbec263270e6
How to cite
Per-State Signatures and Mean Time-to-Failure: An Algorithm for Systems With Simultaneous Failures — arXiv:2610.22181 — arXiv (en), https://arxiv.org/abs/2610.22181 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_cbec263270e6 (Metraipolis archive dc_cbec263270e6, sha256 c491032e6b9a83eb562c8247100fa6bc14fab96bc7a29cd907e418ced9db3f18)
BibTeX
@misc{dccbec263270e6,
title = {Per-State Signatures and Mean Time-to-Failure: An Algorithm for Systems With Simultaneous Failures — arXiv:2610.22181},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.22181},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_cbec263270e6; sha256 c491032e6b9a83eb562c8247100fa6bc14fab96bc7a29cd907e418ced9db3f18},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.22181. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We present an algorithm that computes the structural signature and the mean time-to-failure (MTTF) of a monotone binary system at every one of its states, rather than only at the state in which all components work. It makes no assumption on the structure function and evaluates it exactly once per state, as many times as needed for the signature of the complete system alone, so computing the MTTF everywhere costs only a factor polynomial in the number of components over computing it once. As a by-product, it identifies all minimal path sets. We assume exchangeable component failure times whose survivor count is a continuous-time Markov chain. This setting admits simultaneous failures, as in the Lévy-frailty Marshall-Olkin, binomial failure rate and lethal-shock models, where the simplifications available for single failures do not apply. We use the per-state MTTF to define threshold repair policies. We show that the per-state signature is a strictly finer decision criterion than the MTTF: signature dominance at a common failure count implies MTTF dominance, but not conversely. Under the Lévy-frailty Marshall-Olkin model the MTTF is monotone in the state, which yields the long-run cost rate of every threshold policy in a single pass. Experiments on 22 benchmark networks with up to 30 components and 31 failure models show that the best MTTF-threshold policy has a median excess cost of 0.36% over the optimal state-based policy, and that it is never worse than the best policy that repairs after a fixed number of failures. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno). Categorie arXiv: Data Structures and Algorithms (cs.DS) ; Optimization and Control (math.OC); Probability (math.PR). Pagina del lavoro: https://arxiv.org/abs/2610.22181 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-16T08:49:47.944Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).