• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.3
• /
• pp.654-662
• /
• 2016

As the number of gates and basic events in fault trees increases, it becomes difficult to calculate the exact probability of the top event. In order to overcome this difficulty the BDD methodology can be used to calculate the exact top event probability for small and medium size fault trees in short time. Fault trees are converted to BDD by using CUDD library functions and a failure path search algorithm is proposed to calculate the exact top event probability. The backward search algorithm is more efficient than the forward one in finding failure paths and in the calculation of the top event probability. This backward search algorithm can reduce searching time in the identification of disjoint failure paths from BDD and can be considered as an effective tool to find the cut sets and the minimal cut sets for the given fault trees.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.5
• /
• pp.153-162
• /
• 2011

The minimum cut problem is to minimize c(S,T), that is, to determine source S and sink T such that the capacity of the S-T cut is minimal. The flow-based algorithm is mostly used to find the bottleneck arcs by calculating flow network, and does not presents the minimum cut. This paper suggests an algorithm that simply includes the maximum capacity vertex to adjacent set S or T and finds the minimum cut without obtaining flow network in advance. On applying the suggested algorithm to 13 limited graphs, it can be finds the minimum cut value $_{\min}c$(S, T) with simply and correctly.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.19 no.40
• /
• pp.263-269
• /
• 1996

The most vital arc in the maximum flow problem is that arc whose removal results in the greatest reduction in the value of the maximal flow between a source node and a sink node. This paper develops an algorithm to determine such a most vital arc(MVA) in the maximum flow problem. We first define the transformed network corresponding In a given network in order to compute the minimal capacity for each candidate arc. The set of candidate arcs for a MVA consists of the arcs whose flow is at least as greate as the flow over every arc in a minimal cut As a result, we present a method in which the MVA is determined more easily by computing the minimal capacity in the transformed network. The proposed method is demonstrated by numerical example.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.2
• /
• pp.115-124
• /
• 2000

The most vital arc in the maximum flow problem is that arc whose removal results in the greatest reduction in the value of the maximal flow between a source node and a sink node. This paper develops an algorithm to determine such a most vital arc in the maximum flow problem. We first define the transformed network corresponding to a given network in order to compute the minimal capacity for each candidate arc. The set of candidate arcs for single most vital arc consists of the arcs whose flow is at least as great as the flow over every arc in a minimal cut. As a result we present a method in which the most vital arc is determined more easily by computing the minimal capacity in the transformed network. the proposed method is demonstrated by numerical example and computational experiment.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.6
• /
• pp.711-718
• /
• 2019

BDD is a well-known alternative to the conventional Boolean logic method in fault tree analysis. As the size of fault tree increases, the calculation time and computer resources for BDD dramatically increase. A new failure path search and path restructure method is proposed for efficient calculation of CS and MCS from BDD. Failure path grouping and bottom-up path search is proved to be efficient in failure path search in BDD and path restructure is also proved to be used in order to reduce the number of CS comparisons for MCS extraction. With these newly proposed methods, the top event probability can be calculated using the probability by ASDMP(Approximate Sum of Disjoint MCS Products), which is shown to be equivalent to the result by the conventional MCUB(Minimal Cut Upper Bound) probability.

• Journal of Korean Society for Quality Management
• /
• v.12 no.1
• /
• pp.45-58
• /
• 1984

This paper performs a systematic analysis for failures in gum electro automatic overwrapping machine, using FTA technique. Data for failures which occurred from January, 1978 to June, 1983 are collected from machinery maintenance department at L. Confectionery Co. Ltd. In order to analyse them, COBOL computer program is performed because of a lot of time and effort. The minimal cut sets of the system failures are obtained from computer program. Through a set of analyses, the critical basic failures are found out.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.6
• /
• pp.595-603
• /
• 1992

It has been establisued that the reliability of communication networks is NP hard problem owing to computationally and complexity as the number of componeuts is Increased in large networks. This paper proposed an algorithm for determining upper and lower bounds In the reliability of source-to-terminal in communication networks to solve this problem. The evaluation method follows the next procedures. First, minimal pathset and minimal cut set are serched. Second, it is sorted that the number of components is the same events and the reliability bounds Is evaluated by the section function to extract common variable. The performance of proposed algorithm is also estimate(1 as compared to the reliability of Esary-Proschan, Shogan and Copal.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.19 no.1
• /
• pp.271-276
• /
• 1995

This paper presents a systematic method for the dynamic analysis of flexible mechanical systems containing closed kinematic loops. Kinematics between pairs of contiguous flexible bodies is described with the joint coordinates and the deformation modal coordinates. The cut-joint constraint equations associated with the closed kinematic loops are derived, simply using the geometric conditions. The equations of motions are initially written in terms of the joint and modal coordinates using the velocity transformation technique. Lagrange multipliers associated with the cut-joint constraints for closed-loop systems are then eliminated systematically using the generalized coordinate partitioning method, resulting to a minimal set of equations of motion.

• Journal of the Korean Society of Safety
• /
• v.26 no.4
• /
• pp.87-95
• /
• 2011

The urgent VAI(Vital Area Identification) method development is required since 'The Act of Physical Protection and Radiological Emergency' that is established in 2003 requires an evaluation of physical threats in nuclear facilities and an establishment of physical protection in Korea. The KAERI(Korea Atomic Energy Research Institute) has developed the VAI methodology and VAI software called as VIPEX(Vital area Identification Package EXpert) for identifying the vital areas. This study is to demonstrate the applicability of KAERI's VAI methodology to a hypothetical facility, and to identify the importance of information of cable and piping runs when identifying the vital areas. It is necessarily needed to consider cable and piping runs to determine the accurate and realistic TEPS(Top Event Prevention Set). If the information of cable and piping runs of a nuclear power plant is not considered when determining the TEPSs, it is absolutely impossible to acquire the complete TEPSs, and the results could be distorted by missing it. The VIPEX and FTREX(Fault Tree Reliability Evaluation eXpert) properly calculate MCSs and TEPSs using the fault tree model, and provide the most cost-effective method to save the VAI and physical protection costs.

• Nuclear Engineering and Technology
• /
• v.54 no.1
• /
• pp.110-116
• /
• 2022

Human failure event (HFE) dependency analysis is a part of human reliability analysis (HRA). For efficient HFE dependency analysis, a maximum number of minimal cut sets (MCSs) that have HFE combinations are generated from the fault trees for the probabilistic safety assessment (PSA) of nuclear power plants (NPPs). After collecting potential HFE combinations, dependency levels of subsequent HFEs on the preceding HFEs in each MCS are analyzed and assigned as conditional probabilities. Then, HFE recovery is performed to reflect these conditional probabilities in MCSs by modifying MCSs. Inappropriate HFE dependency analysis and HFE recovery might lead to an inaccurate core damage frequency (CDF). Using the above process, HFE recovery is performed on MCSs that are generated with a non-zero truncation limit, where many MCSs that have HFE combinations are truncated. As a result, the resultant CDF might be underestimated. In this paper, a new method is suggested to incorporate HFE recovery into the MCS generation stage. Compared to the current approach with a separate HFE recovery after MCS generation, this new method can (1) reduce the total time and burden for MCS generation and HFE recovery, (2) prevent the truncation of MCSs that have dependent HFEs, and (3) avoid CDF underestimation. This new method is a simple but very effective means of performing MCS generation and HFE recovery simultaneously and improving CDF accuracy. The effectiveness and strength of the new method are clearly demonstrated and discussed with fault trees and HFE combinations that have joint probabilities.