A Polynomial Algorithm for Computing the Optimal Repair Strategy in a System with Independent Component Failures release_chalr3hsfzg2bhwxriqzv2d3l4

by Sampath Srinivas

Released as a report .

2013  

Abstract

The goal of diagnosis is to compute good repair strategies in response to anomalous system behavior. In a decision theoretic framework, a good repair strategy has low expected cost. In a general formulation of the problem, the computation of the optimal (lowest expected cost) repair strategy for a system with multiple faults is intractable. In this paper, we consider an interesting and natural restriction on the behavior of the system being diagnosed: (a) the system exhibits faulty behavior if and only if one or more components is malfunctioning. (b) The failures of the system components are independent. Given this restriction on system behavior, we develop a polynomial time algorithm for computing the optimal repair strategy. We then go on to introduce a system hierarchy and the notion of inspecting (testing) components before repair. We develop a linear time algorithm for computing an optimal repair strategy for the hierarchical system which includes both repair and inspection.
In text/plain format

Archived Files and Locations

application/pdf  298.4 kB
file_2np7fjl76zbsvauuhhruxnlne4
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  report
Stage   submitted
Date   2013-02-20
Version   v1
Language   en ?
Number  UAI-P-1995-PG-515-522
arXiv  1302.4985v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 127345a0-fb85-4538-86d3-f13231b923b5
API URL: JSON