A Model-Based Diagnosis Framework for Distributed Systems

Abstract : We present a distributed model-based diagnostics architecture for embedded diagnostics. We extend the traditional model-based definition of diagnosis to a distributed diagnosis definition, in which we have a collection of distributed components whose interconnectivity is described by a directed graph. Assuming that each component can compute a local minimal diagnosis based only on sensors internal to that component and knowledge only of its own system description, we describe an algorithm that guarantees a globally sound, complete and minimal diagnosis for the complete system. By compiling diagnoses for groups of components based on the interconnectivity graph, the algorithm efficiently synthesizes the local diagnoses computed in distributed components into a globally-sound system diagnosis using a graph-based message-passing approach.

[1]  Raymond Reiter,et al.  A Theory of Diagnosis from First Principles , 1986, Artif. Intell..

[2]  Rowland R. Johnson,et al.  DATMS: A Framework for Distributed Assumption Based Reasoning , 1989, Distributed Artificial Intelligence.

[3]  Brian C. Williams,et al.  Diagnosing Multiple Faults , 1987, Artif. Intell..

[4]  Sheila A. McIlraith,et al.  Theorem Proving with Structured Theories , 2001, IJCAI.

[5]  Johan de Kleer,et al.  An Assumption-Based TMS , 1987, Artif. Intell..

[6]  Makoto Yokoo,et al.  The effect of nogood learning in distributed constraint satisfaction , 2000, Proceedings 20th IEEE International Conference on Distributed Computing Systems.

[7]  David J. Spiegelhalter,et al.  Local computations with probabilities on graphical structures and their application to expert systems , 1990 .

[8]  Peter Fröhlich,et al.  Diagnostic Agents for Distributed Systems , 1997, ModelAge Workshop.

[9]  Rina Dechter,et al.  Diagnosing Tree-Decomposable Circuits , 1995, IJCAI.

[10]  Derek G. Corneil,et al.  Complexity of finding embeddings in a k -tree , 1987 .

[11]  Makoto Yokoo,et al.  The Distributed Constraint Satisfaction Problem: Formalization and Algorithms , 1998, IEEE Trans. Knowl. Data Eng..

[12]  Robin Thomas,et al.  Directed Tree-Width , 2001, J. Comb. Theory, Ser. B.

[13]  Laurent Simon,et al.  Efficient Consequence Finding , 2001, IJCAI.

[14]  Peter Struss,et al.  The Consistency-based Approach to Automated Diagnosis of Devices , 1996, KR 1996.

[15]  Markus Stumptner,et al.  Diagnosing tree-structured systems , 2001, Artif. Intell..

[16]  Paul D. Seymour,et al.  Graph Minors: XV. Giant Steps , 1996, J. Comb. Theory, Ser. B.

[17]  Gregory Provan Distributed diagnosability properties of discrete event systems , 2002, Proceedings of the 2002 American Control Conference (IEEE Cat. No.CH37301).

[18]  Hans L. Bodlaender,et al.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.

[19]  Marco Cadoli,et al.  A Survey on Knowledge Compilation , 1997, AI Commun..

[20]  Adnan Darwiche,et al.  Model-Based Diagnosis using Structured System Descriptions , 1998, J. Artif. Intell. Res..

[21]  Sheila A. McIlraith,et al.  Partition-Based Logical Reasoning , 2000, KR.

[22]  Hans L. Bodlaender,et al.  Treewidth: Algorithmic Techniques and Results , 1997, MFCS.

[23]  Benedita Malheiro,et al.  Solving Conflicting Beliefs with a Distributed Belief Revision Approach , 2000, IBERAMIA-SBIA.