• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1995.04b
• /
• pp.457-462
• /
• 1995

This paper describes diagnosis strategy of the Flexible Multiple Fault Diagnosis Module for forecasting faults in system and deciding current machine state form sensor information. Most studydeal with diagnosis control stategy about single fault in a system, this studies deal with multiple fault diagnosis. This strategy is consist of diagnosis control module such as backward tracking expert system shell, various neural network, numerical model to predict machine state and communication module for information exchange and cooperate between each model. This models are used to describe structure, function and behavior of subsystem, complex component and total system. Hierarchical structure is very efficient to represent structural, functional and behavioral knowledge. FT(Fault Tree). ST(Symptom Tree), FCD(Fault Consequence Diagrapy), SGM(State Graph Model) and FFM(Functional Flow Model) are used to represent hierachical structure. In this study, IA(Intelligent Agent) concept is introduced to match FT component and event symbol in diagnosed system and to transfer message between each event process. Proposed diagnosis control module is made of IPC(Inter Process Communication) method under UNIX operating system.

• Nuclear Engineering and Technology
• /
• v.50 no.6
• /
• pp.854-859
• /
• 2018

Calculating minimal cut sets is a typical quantification method used to evaluate the top event probability for a fault tree. If minimal cut sets cannot be calculated or if the accuracy of the quantification result is in doubt, the Monte Carlo method can provide an alternative for fault tree quantification. The Monte Carlo method for fault tree quantification tends to take a long time because it repeats the calculation for a large number of samples. Herein, proposal is made to improve the quantification algorithm of a fault tree with circular logic. We developed a top-down iteration algorithm that combines the characteristics of the top-down approach and the iteration approach, thereby reducing the computation time of the Monte Carlo method.

• IE interfaces
• /
• v.20 no.3
• /
• pp.288-297
• /
• 2007

Success of semiconductor/LCD industry depends on its yield and quality of product. For the purpose, FDC (Fault Detection and Classification) system is used to diagnose fault state in main manufacturing processes by monitoring time series data collected by equipment sensors which represent various conditions of the equipment. The data set is segmented at the start and end of each product lot processing by a trigger event module. However, in practice, segmented sensor data usually have the features of data asynchronization such as different start points, end points, and data lengths. Due to the asynchronization problem, false alarm (type I error) and missed alarm (type II error) occur frequently. In this paper, we propose a robust process fault detection system by integrating a process event detection method and a similarity measuring method based on dynamic time warping algorithm. An experiment shows that the proposed system is able to recognize abnormal condition correctly under the asynchronous data situation.

• The Journal of Engineering Geology
• /
• v.8 no.1
• /
• pp.35-49
• /
• 1998

To interpret the movement historv of the Yangsan fault, the paleostresses were analyzed from about 1,000 striated small faults and 330 extension joints which were measured from 37 sites near and along the strike of the Yangsan fault from Yangsan-si, Kyeongsangnam-do to the Shinkwang-myeon, Kyeongsangbuk-do. Six sequential tectonic events have boen established as followings: (I) NW-SE extension, (Il) ENE-WSW compression and NNW-SSE extension, (III) NW-SE compression, (W) ENE-WSW extension, (V) E-W comoression and N-S extension, and (VI) NNE-SSW compression and(VI) NNE-SSWextension. The movement history of the Yangsan fault rnrning in NNE direction were inteepreted based on these six sequential stress fields. The initial feature of the Yangsan fault was formed at the first stage with the development of extension fractures by tectonic event (I) of NW-SE extension. The fault was acted continuously with a right-1ateral strike-slip movement by tectonic event( II) closely related to event( I). The movements had been continued until the Late Miocene. This age was the most active period in faulting. The left-lateral strike-slip movement was followed by subsequent tectonic events (ffi) and (IV). The activity of the Yangsan fault was suspended temporarily by compression of tectonic event (V) which was perpendicular to the strike of the fault. This period might be very short and the magnitude of the tectonic was also small. In the last stage, the fault acted with slight extension or right-lateral moveenent by tectonic event (VI).

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10a
• /
• pp.358-361
• /
• 1996

In this paper, we discuss decentralized optimal fault tolerant supervisory control issues on the basis of failure analysis and diagnosis from the angle of discrete event dynamic system. We address the detectability and the observability problems, and develope fault tolerant supervisory control system upon the failure analysis and diagnosis schemes. A complete min-cut is introduced and the procedure for finding the achievable or nonachievable layered optimal legal sublanguages is suggested for a preferential option among the reachable states in the controlled plant. A layered optimal supervisory control framework is proposed upon these. We extend the concept of decentralized supervisory control by considering the problem of combination of decentralized with centralized control in case pure decentralized control happens to be inadequate. We introduce the concept of locally controllable pair and present a hybrid decentralized supervisory control framework. Finally, we propose the analytical framework for a decentralized optimal fault tolerant supervisory control systems.

• Journal of the Korean Society of Safety
• /
• v.32 no.3
• /
• pp.160-171
• /
• 2017

US national research laboratories developed the first Vital Area Identification (VAI) method for the physical protection of nuclear power plants that is based on Event Tree Analysis (ETA) and Fault Tree Analysis (FTA) techniques in 1970s. Then, Korea Atomic Energy Research Institute proposed advanced VAI method that takes advantage of fire and flooding Probabilistic Safety Assessment (PSA) results. In this study, in order to minimize the burden and difficulty of VAI, (1) a set of streamlined VAI rules were developed, and (2) this set of rules was applied to PSA fault tree and event tree at the initial stage of VAI process. This new rule-based VAI method is explained, and its efficiency and correctness are demonstrated throughout this paper. This new rule-based VAI method drastically reduces problem size by (1) performing PSA event tree simplification by applying VAI rules to the PSA event tree, (2) calculating preliminary prevention sets with event tree headings, (3) converting the shortest preliminary prevention set into a sabotage fault tree, and (4) performing usual VAI procedure. Since this new rule-based VAI method drastically reduces VAI problem size, it provides very quick and economical VAI procedure. In spite of an extremely reduced sabotage fault tree, this method generates identical vital areas to those by traditional VAI method. It is strongly recommended that this new rule-based VAI method be applied to the physical protection of nuclear power plants and other complex safety-critical systems such as chemical and military systems.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.17 no.1
• /
• pp.65-78
• /
• 2017

Single Event Transient has a critical impact on highly integrated logic circuits which are currently common in various commercial and consumer electronic devices. Reliability against the soft and intermittent faults will become a key metric to evaluate such complex system on chip designs. Our previous work analyzing soft errors was focused on parallelizing and optimizing error propagation procedures for individual transient faults on logic and sequential cells. In this paper, we present a new propagation technique where a fault binary decision diagram (BDD) continues to merge every new fault generated from the subsequent logic gate traversal. BDD-based transient fault analysis has been known to provide the most accurate results that consider both electrical and logical properties for the given design. However, it suffers from a limitation in storing and handling BDDs that can be increased in size and operations by the exponential order. On the other hand, the proposed method requires only a visit to each logic gate traversal and unnecessary BDDs can be removed or reduced. This results in an approximately 20-200 fold speed increase while the existing parallelized procedure is only 3-4 times faster than the baseline algorithm.

• The Journal of Information Systems
• /
• v.17 no.3
• /
• pp.25-37
• /
• 2008

In a fault tree analysis, an uncertainty importance measure is often used to assess how much uncertainty of the top event probability (Q) is attributable to the uncertainty of a basic event probability ($q_i$), and thus, to identify those basic events whose uncertainties need to be reduced to effectively reduce the uncertainty of Q. For evaluating the measures suggested by many authors which assess a percentage change in the variance V of Q with respect to unit percentage change in the variance $v_i$ of $q_i$, V and ${\partial}V/{\partial}v_i$ need to be estimated analytically or by Monte Carlo simulation. However, it is very complicated to analytically compute V and ${\partial}V/{\partial}v_i$ for large-sized fault trees, and difficult to estimate them in a robust manner by Monte Carlo simulation. In this paper, we propose a method for evaluating the measure using discretization technique and Monte Carlo simulation. The proposed method provides a stable uncertainty importance of each basic event.

• Journal of the Korea Safety Management & Science
• /
• v.2 no.4
• /
• pp.91-102
• /
• 2000

Nowadays, every kind of system is changed so complex and enormous, it is necessary to assure system reliability, product liability and safety. Fault tree analysis(FTA) is a reliability/safety design analysis technique which starts from consideration of system failure effect, referred to as “top event”, and proceeds by determining how these can be caused by single or combined lower level failures or events. So in fault tree analysis, it is important to find the combination of events which affect system failure. Minimal cut sets(MCS) and minimal path sets(MPS) are used in this process. FTA-I computer program is developed which calculates MCS and MPS in terms of Gw-Basic computer language considering Fussell's algorithm. FTA-II computer program which analyzes importance and function cost of VE consists. of five programs as follows : (l) Structural importance of basic event, (2) Structural probability importance of basic event, (3) Structural criticality importance of basic event, (4) Cost-Failure importance of basic event, (5) VE function cost analysis for importance of basic event. In this study, a method of initiation such as failure, function and cost in FTA is suggested, and especially the priority rank which is calculated by computer-aided decision analysis program developed in this study can be used in decision making determining the most important basic event under various conditions. Also the priority rank can be available for the case which selects system component in FMEA analysis.

• Journal of Korean Institute of Industrial Engineers
• /
• v.22 no.1
• /
• pp.129-139
• /
• 1996

Fault tree analysis is NP-hard problem. In this paper, we present a method which reduces size of the fault tree by eliminating the irrelevant events. Irrelevant event is the event which has no contribution to the system failure. In a fault tree, the irrelevant events occur due to the existence of the replicated events. By investigating the structure of the replicated events we establish the conditions which characterize the irrelevant events. Based on these conditions we present the computational algorithm which eliminate the irrelevant events. Complexity of the algorithm is shown to be polynomial and so, this algorithm can be utilized efficiently in FTA.