Published 1988
by Division of Systems Research, Office of Nuclear Regulatory Research, U.S. Nuclear Regulatory Commission in Washington, DC .
Written in English
Edition Notes
| Other titles | Fast bottom up algorithm for computing the cut sets of noncoherent fault trees. |
| Statement | prepared by G.C. Corynen. |
| Contributions | U.S. Nuclear Regulatory Commission. Office of Nuclear Regulatory Research. Division of Systems Research., Lawrence Livermore National Laboratory. |
| The Physical Object | |
|---|---|
| Pagination | vi, 59 p. : |
| Number of Pages | 59 |
| ID Numbers | |
| Open Library | OL15385337M |
A new algorithm (CS-MC) for computing the minimal cuts of scoherent fault trees is presented. Input events of the fault tree are assumed classified . In computer science, a tree is a widely used abstract data type (ADT) that simulates a hierarchical tree structure, with a root value and subtrees of children with a parent node, represented as a set of linked nodes.. A tree data structure can be defined recursively as a collection of nodes (starting at a root node), where each node is a data structure consisting of a value, together with a. Fault trees are used as a major tool in the study of system safety as well as in reliability and availability studies. fault trees, and cut sets. Article. Dec A fast BDD algorithm for. This paper proposes a new method for minimal cut sets generation of a coherent fault tree (FT) without repeated events. The approach is based on a .
Fault tree analysis (FTA) is one of the most prominent techniques here, used by a wide range of industries. Fault trees (FTs) are a graphical method that model how failures propagate through the system, i.e., how component failures lead to system failures. Due to redundancy and spare management, not all component failures lead to a system by: Object-oriented programming techniques are used in an algorithm for the direct evaluation of fault trees. The algorithm combines a simple bottom-up procedure for . This evaluation scheme has been implemented in the computer code TREEMOD, a part of the program system RISA, capable of computing the dominant cut sets of very large and interconnected fault trees. (e) Describe a dynamic-programming algorithm that computes the edit distance from x[m] to y[n]. (Do not use a memoized recursive algorithm. Your algorithm should be a classical, bottom-up, tabular algorithm.) Analyze the running time and space requirements of your algorithm. Solution: Construct a table T where each entry T[i,j] = cxy (i File Size: KB.
Common-Cause Cut Sets Common Causes and Basic Events Obtaining Common-Cause Cut Sets Fault-Tree Linking Along an Accident Sequence Simple Example A More Realistic Example Noncoherent Fault Trees /5(6). Start studying FunctProg Chapter 9. Learn vocabulary, terms, and more with flashcards, games, and other study tools. Heap Sort - Free download as Powerpoint Presentation .ppt), PDF File .pdf), Text File .txt) or view presentation slides online. Heaps. This banner text can have markup.. web; books; video; audio; software; images; Toggle navigation.
