In this paper we present a model-based approach to the on-line diagnosis of dynamic systems. We model the system to be diagnosed as a discrete, synchronous transition system and capture temporal phenomena such as the change of the system inputs, the evolution of the system internal status and the evolution of the health conditions of the system components. The on-line diagnostic task consists of three subtasks: estimating the potentially highly ambiguous belief state (i.e. the set of possible system states), detecting significant changes in the belief state (in particular, changes in the set of preferred diagnoses) and presenting the preferred diagnoses to the user. We present a backtrack-free algorithm that keeps track of the complete belief state even when such a set is very large; we then introduce efficient algorithms that perform the detection of changes in the set of preferred diagnoses and the presentation of preferred diagnoses. The selection of preferred diagnoses is based on the adoption of ranks for representing the probabilities of occurrence of faults. In order to achieve completeness and efficiency, we exploit symbolic techniques (in particular, Ordered Binary Decision Diagrams) to encode and manipulate the system model and the belief state. The approach is tested on two real-world models, taken from the automotive and aerospace domains.
An on-line approach to the computation and presentation of preferred diagnoses for dynamic systems
TORTA, GIANLUCA;TORASSO, Pietro
2007-01-01
Abstract
In this paper we present a model-based approach to the on-line diagnosis of dynamic systems. We model the system to be diagnosed as a discrete, synchronous transition system and capture temporal phenomena such as the change of the system inputs, the evolution of the system internal status and the evolution of the health conditions of the system components. The on-line diagnostic task consists of three subtasks: estimating the potentially highly ambiguous belief state (i.e. the set of possible system states), detecting significant changes in the belief state (in particular, changes in the set of preferred diagnoses) and presenting the preferred diagnoses to the user. We present a backtrack-free algorithm that keeps track of the complete belief state even when such a set is very large; we then introduce efficient algorithms that perform the detection of changes in the set of preferred diagnoses and the presentation of preferred diagnoses. The selection of preferred diagnoses is based on the adoption of ranks for representing the probabilities of occurrence of faults. In order to achieve completeness and efficiency, we exploit symbolic techniques (in particular, Ordered Binary Decision Diagrams) to encode and manipulate the system model and the belief state. The approach is tested on two real-world models, taken from the automotive and aerospace domains.File | Dimensione | Formato | |
---|---|---|---|
aicom07dynamic.pdf
Accesso riservato
Tipo di file:
POSTPRINT (VERSIONE FINALE DELL’AUTORE)
Dimensione
251.94 kB
Formato
Adobe PDF
|
251.94 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.