Search

This paper presents an improved model-based reasoning method to test circuit faults. The proposed automated testing procedure is applicable even when the target system contains multiple faulty modes. Based on the proposed method, the observation can be organised to guarantee correct solutions are included in the restricted candidate space. The existent consistency-checking method and abductive reasoning method are special cases of the proposed method. The relationship between the testing procedure and the corresponding prime implication is formally analyzed for algorithmic implementation. The work is being extended, funded by the Chinese National Natural Science Foundation, in collaboration with Jilin University, China.

This paper presents an improved model-based reasoning method to test circuit faults. The proposed automated testing procedure is applicable even when the target system contains multiple faulty modes. Based on the proposed method, the observation can be organised to guarantee correct solutions are included in the restricted candidate space. The existent consistency-checking method and abductive reasoning method are special cases of the proposed method. The relationship between the testing procedure and the corresponding prime implication is formally analyzed for algorithmic implementation. The work is being extended, funded by the Chinese National Natural Science Foundation, in collaboration with Jilin University, China.

This paper presents an improved model-based reasoning method to test circuit faults. The proposed automated testing procedure is applicable even when the target system contains multiple faulty modes. Based on the proposed method, the observation can be organised to guarantee correct solutions are included in the restricted candidate space. The existent consistency-checking method and abductive reasoning method are special cases of the proposed method. The relationship between the testing procedure and the corresponding prime implication is formally analyzed for algorithmic implementation. The work is being extended, funded by the Chinese National Natural Science Foundation, in collaboration with Jilin University, China.

A set S that has a non-empty intersection with every set in a collection of sets C is called a hitting set of C. If no element can be removed from S without violating the hitting set property, S is considered to be minimal. Several interesting problems can be partly formulated as ones that a minimal hitting set or more ones have to be found. Many of these problems are required for proper solutions, but sometimes the approximate solutions are enough. A genetic algorithm and advantaged algorithms were devised for computing minimal hitting sets. An improvement makes them get most minimal hitting sets efficiently. Furthermore, they are smaller, i.e., fewer rules., Held at Semmering, Austria, 2-4 May 2002. The original document contains color images. This article is from ADA405380 Thirteenth International Workshop on Principles of Diagnosis (DX-2002)