Create and explore imaginative 3D worlds with our new product Dreamfield (opens in a new tab)

Determine signature weights that close the MTTF-threshold performance gap

Determine weighting vectors for the per-state signatures of monotone binary systems that close the performance gap between the best MTTF-threshold repair policy and the optimal state-based repair policy.

Background

The paper establishes that the per-state signature is strictly more informative than the mean time-to-failure (MTTF), because the MTTF is only a single linear projection of the signature. Signature-threshold policies can therefore distinguish states that MTTF-threshold policies treat alike, but their potential improvement is bounded by the gap between the best MTTF-threshold policy and the optimal state-based policy.

The authors report that this gap is largest for nearly independent failures, inexpensive components, and large systems. They explicitly leave unresolved the problem of identifying signature weights that exploit the additional information in the per-state signatures sufficiently to eliminate this gap.

References

Finally, the gap between the best MTTF threshold and the optimal state-based policy, largest for nearly independent failures, cheap components and large systems, bounds what weighting the per-state signature differently can achieve; finding weights that close it, and comparing states with different numbers of failed components, remain open.

— Per-State Signatures and Mean Time-to-Failure: An Algorithm for Systems With Simultaneous Failures  (2610.22181 - Lagos et al., 15 Oct 2026) in Section Conclusions and discussion, Section 6