Hostname: page-component-cd9895bd7-fscjk Total loading time: 0 Render date: 2024-12-26T07:51:59.876Z Has data issue: false hasContentIssue false

The SACSO methodology for troubleshooting complex systems

Published online by Cambridge University Press:  11 January 2002

FINN V. JENSEN
Affiliation:
Department of Computer Science, Aalborg University, Aalborg, Denmark
UFFE KJÆRULFF
Affiliation:
Department of Computer Science, Aalborg University, Aalborg, Denmark
BRIAN KRISTIANSEN
Affiliation:
Hewlett-Packard Laboratory for Normative Systems, Aalborg, Denmark
HELGE LANGSETH
Affiliation:
Department of Computer Science, Aalborg University, Aalborg, Denmark
CLAUS SKAANNING
Affiliation:
Hewlett-Packard Laboratory for Normative Systems, Aalborg, Denmark
JIŘÍ VOMLEL
Affiliation:
Department of Computer Science, Aalborg University, Aalborg, Denmark
MARTA VOMLELOVÁ
Affiliation:
Department of Computer Science, Aalborg University, Aalborg, Denmark

Abstract

The paper describes the task of performing efficient decision-theoretic troubleshooting of electromechanical devices. In general, this task is NP-complete, but under fairly strict assumptions, a greedy approach will yield an optimal sequence of actions, as discussed in the paper. This set of assumptions is weaker than the set proposed by Heckerman et al. (1995). However, the printing system domain, which motivated the research and which is described in detail in the paper, does not meet the requirements for the greedy approach, and a heuristic method is used. The method takes value of identification of the fault into account and it also performs a partial two-step look-ahead analysis. We compare the results of the heuristic method with optimal sequences of actions, and find only minor differences between the two.

Type
Research Article
Copyright
© 2001 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)