Stuck-at fault

About: Stuck-at fault is a research topic. Over the lifetime, 9707 publications have been published within this topic receiving 160254 citations.

Diagnosing multiple faults using knowledge about malfunctioning behavior

Abstract: A technical fault diagnosis system based on knowledge about the structure of a device and the behavior of its components is presented. This approach allows knowledge about components to be reused for new devices and simplifies maintenance of the fault diagnosis system. A new method for diagnosing multiple faults using this representation is presented and discussed. The method assumes that both normal functioning and malfunctioning behavior are described for components in the form of user-defined constraints. A prototype implementation for parts of the method exists and has been compared with a traditional fault-tree implementation of a trouble-shooting system for an separator application.

Diagnosis of resistive-open and stuck-open defects in digital CMOS ICs

Abstract: A resistive-open defect is an imperfect circuit connection that can be modeled as a defect resistor between two circuit nodes that should be connected. A stuck-open (SOP) defect is a complete break (no current flow) between two circuit nodes that should be connected. Conventional single stuck-at fault diagnosis cannot precisely diagnose these two defects because the test results of defective chips depend on the sequence of test patterns. This paper presents precise diagnosis techniques for these two defects. The diagnosis techniques take the test-pattern sequence into account, and therefore, produce precise diagnosis results. Also, our diagnosis technique handles multiple faults of different fault models. The diagnosis techniques are validated by experimental results. Twelve SOP and one resistive-open chips are diagnosed out of a total of 459 defective chips.

Online Fault Diagnosis for Power Transmission Networks Using Fuzzy Digraph Models

Abstract: This paper presents an effective method for online fault diagnosis, in power transmission networks, based on fuzzy directed graph (digraph) models. When the relationships between fault sections and protective devices are represented by a digraph model, the possible fault sections can be traced through the proposed fuzzy inference algorithm. The main features of the proposed method include its ease of implementation, parallel information-processing capability, and uncertainty reasoning capabilities. Upon testing in two systems, the proposed method was demonstrated to be feasible and yielded satisfactory results, even with complex fault scenarios.

Data-mining-based fault during power swing identification in power transmission system

Abstract: This study proposes a decision-tree-based scheme for detection and classification of fault during power swing in double circuit transmission lines. The power swing may result due to switching in/out of heavy loads, switching of lines, clearance of short-circuit faults, generator tripping or load shedding. The proposed decision tree approach makes the discrimination among no fault situation/power swing and fault during power swing. The fundamental components of currents and voltages and zero sequence currents measured at only one end of the double circuit line are used as input to decision tree. To ascertain validity of the proposed scheme, it is tested for variation in fault type, fault inception angle, fault location and fault resistance. The main advantage of this proposed scheme is that it detects fault during power swing within half cycle time and classify the type of fault and identify the faulty phase also.

The Fault Detection Problem

Abstract: One of the most important challenges in distributed computing is ensuring that services are correct and available despite faults. Recently it has been argued that fault detection can be factored out from computation, and that a generic fault detection service can be a useful abstraction for building distributed systems. However, while fault detection has been extensively studied for crash faults, little is known about detecting more general kinds of faults. This paper explores the power and the inherent costs of generic fault detection in a distributed system. We propose a formal framework that allows us to partition the set of all faults that can possibly occur in a distributed computation into several fault classes . Then we formulate the fault detection problem for a given fault class, and we show that this problem can be solved for only two specific fault classes, namely omission faults and commission faults . Finally, we derive tight lower bounds on the cost of solving the problem for these two classes in asynchronous message-passing systems.