260 likes | 384 Views
Hierarchical Diagnosis of Multiple Faults. Sajjad Siddiqi and Jinbo Huang National ICT Australia and Australian National University. Consistency-based Diagnosis. C. Abnormal observation : A B D. A. X. D. Y. B. Which gate(s) are broken?. Consistency-based Diagnosis. C. A.
E N D
Hierarchical Diagnosis of Multiple Faults Sajjad Siddiqi and Jinbo Huang National ICT Australia and Australian National University
Consistency-based Diagnosis C Abnormal observation : A B D A X D Y B Which gate(s) are broken?
Consistency-based Diagnosis C A X D Y B System model : okX (A C) okY (B C) D Health variables: okX, okY Observables: A, B, D Nonobservable: C
Consistency-based Diagnosis C Abnormal observation : A B D A X D Y B System model : okX (A C) okY (B C) D Find values of (okX, okY) consistent with : (0, 0), (0, 1), (1, 0)
Consistency-based Diagnosis System model over health variables (okX, okY, …) observables nonobservables Given observation , diagnosis is assignment to health variables consistent with Consider minimum-cardinality diagnoses
Search-based Approach Search for diagnoses consistent with Reduced to finding solutions to SAT instance Cardinality enforced by extra constraints Often restricted to single/double faults
Compilation-based Approach System Model Tractable Form Compile Query Evaluator
Compilation-based Approach Most work is done off-line On-line diagnosis is efficient Off-line work is amortized over multiple queries Can handle arbitrary cardinality Off-line compilation can be bottleneck
Decomposable Negation Normal Form (DNNF) or DAG of nested and/or Conjuncts share no variable (decomposable) and or X3 and X1 X2
Diagnosis Using DNNF C A X D Y B 1 1 Observation: A B D System model : okX (A C) okY (B C) D 0 1 1 0 1 0
Diagnosis Using DNNF C A X D Y B or Observation: A B D System model : okX (A C) okY (B C) D okX okY
Compilation-based Approach System Model Tractable Form Compile Bottleneck Query Evaluator
Compilation-based Approach Requires a health variable for each component c1908 has 880 gates; basic encoding fails to compile New technique to reduce number of health variables Preserves soundness and completeness w.r.t. min-cardinality diagnoses Requires only 160 health variables for c1908
Identifying Cones Gate G dominates gate X if any path from X to output of circuit contains G All gates dominated by G form a cone Dominators found by breath-first traversal of circuit Treat maximal cones as blackboxes
Abstraction of Circuit C = {T, U, V, A, B, C}
Top-level Diagnosis Diagnosis: {A, B, C}
Diagnosis of Cone Need to set inputs/output of cone according to top-level diagnosis Rest is similar, but not a simple recursive call (to avoid redundancy) Once cone diagnoses found, global diagnoses obtained by substitution
Diagnosis of Cone Top-level diagnosis: {A, B, C} 3 diagnoses for cone A: {A}, {D}, {E} 3 global diagnoses by substitution: {A, B, C} {D, B, C} {E, B, C}
Soundness Top-level diagnoses have same cardinality. Substitutions do not alter cardinality (cones do not overlap). Remains to show that cardinality of these diagnoses, d, is smallest. Proof by contradiction: Suppose there is diagnosis |P| < d. Replace every gate in P with its highest dominator to obtain P’. P’ is a valid top-level diagnosis, contradicting soundness of baseline diagnoser
Completeness Need to show every min-cardinality diagnosis is found Given diagnosis P of min cardinality d, replace every gate in P with its highest dominator to obtain P’ P’ has cardinality d, and only mentions gates in top-level abstraction, and hence will be found by top-level diagnosis (by completeness of baseline diagnoser) P itself will be found by substitution (by completeness of cone diagnosis)
Experiments Use ISCAS85 circuits Observations (inputs/outputs) randomly generated Multiple instances per circuit Use tool from (Huang and Darwiche, 2005) as baseline diagnoser
Conclusion New technique for compilation-based diagnosis to scale up Preserves soundness and completeness w.r.t. min-cardinality diagnoses For further scalability, hybrid of search and compilation is possible