FAULT TREE ANALYSIS: REALISTIC EXAMPLE, MINIMAL CUT SETS.

Slides:

Advertisements

Similar presentations

EET 1131 Unit 5 Boolean Algebra and Reduction Techniques

Advertisements

Chapter 9 -- Simplification of Sequential Circuits.

Functional Dependencies- Examples

Optimization of Sequential Networks Step in Synthesis: Problem Flow Table Reduce States Minimum-State Table State Assignment Circuit Transition Table Flip-Flop.

Based on text by S. Mourad "Priciples of Electronic Systems" Digital Testing: Design Representation and Fault Detection

Glitches & Hazards.

ECE 238L Computer Logic Design Spring 2010

1 Fault-Tolerant Computing Systems #6 Network Reliability Pattara Leelaprute Computer Engineering Department Kasetsart University

Knowledge Repn. & Reasoning Lec. #3: Consequence Finding & Prime Implicates/Implicants UIUC CS 498: Section EA Professor: Eyal Amir Fall Semester 2004.

Gate-level Minimization

Reliability Block Diagrams A reliability block diagram is a success-oriented network describing the function of the system. If the system has more than.

Fault Tree Analysis Part 6 – Solutions of Fault Trees.

Matrix Multiplication To Multiply matrix A by matrix B: Multiply corresponding entries and then add the resulting products (1)(-1)+ (2)(3) Multiply each.

FPtree/FPGrowth. FP-Tree/FP-Growth Algorithm Use a compressed representation of the database using an FP-tree Then use a recursive divide-and-conquer.

Contemporary Logic Design Two-Level Logic © R.H. Katz Transparency No. 4-1 Chapter #2: Two-Level Combinational Logic Section 2.3, Switches and Tools.

EET 1131 Unit 5 Boolean Algebra and Reduction Techniques

Unit 8 Combinational Circuit Design and Simulation Using Gates Ku-Yaw Chang Assistant Professor, Department of Computer Science.

Simplify Simplify (-8) 0 1 If arc BC = 84°, then m ∠ BAC = 42° A B C.

ECON 1150 Matrix Operations Special Matrices

B-1 Appendix B - Reduction of Digital Logic Principles of Computer Architecture by M. Murdocca and V. Heuring © 1999 M. Murdocca and V. Heuring Principles.

Statistical Analysis Professor Lynne Stokes Department of Statistical Science Lecture 14 Sequential Experimentation, Screening Designs, Fold-Over Designs.

FAULT TREE ANALYSIS (FTA). QUANTITATIVE RISK ANALYSIS Some of the commonly used quantitative risk assessment methods are; 1.Fault tree analysis (FTA)

Chapter 3: Digital Logic Dr Mohamed Menacer Taibah University

Computing the chromatic number for block intersection graphs of Latin squares Ed Sykes CS 721 project McMaster University, December 2004 Slide 1.

1 EG 32 Digital Electronics Thought for the day You learn from your mistakes..... So make as many as you can and you will eventually know everything.

Chapter 11 – Counting Methods Intro to Counting Methods Section 11.1: Counting by Systematic Listing.

Minimum Cover of F. Minimal Cover for a Set of FDs Minimal cover G for a set of FDs F: –Closure of F = closure of G. –Right hand side of each FD in G.

Computing the Cross Product The formula to compute the cross product is a complex one when vectors are in Cartesian form: if u = [a, b, c] and v = [d,

Computer Arithmetic, K-maps Prof. Sin-Min Lee Department of Computer Science.

Cryptography Lecture 17: Advanced Encryption Standard (AES) Piotr Faliszewski.

AES Encryption FIPS 197, November 26, Bit Block Encryption Key Lengths 128, 192, 256 Number of Rounds Key Length Rounds Block.

Lecture 3. Combinational Logic 2 Prof. Taeweon Suh Computer Science Education Korea University 2010 R&E Computer System Education & Research.

CSC2100B Tutorial 10 Graph Jianye Hao.

7-4: Parallel Lines and Proportional Parts Expectation: G1.1.2: Solve multi-step problems and construct proofs involving corresponding angles, alternate.

IAEA Training Course on Safety Assessment of NPPs to Assist Decision Making System Analysis Workshop Information IAEA Workshop City, Country XX - XX Month,

Key Observation Adjacencies in the K-Map

Digital Logic (Karnaugh Map). Karnaugh Maps Karnaugh maps (K-maps) are graphical representations of boolean functions. One map cell corresponds to a row.

SYSTEMS RELIABILTY 1. SYSTEMS are basically built of different components and /or subsystems. For each component, there is an assigned role in the system.

TOPIC : Fault detection and fault redundancy UNIT 2 : Fault modeling Module 2.3 Fault redundancy and Fault collapsing.

8-1 Building Blocks of Geometry Course 2 Warm Up Warm Up Lesson Presentation Lesson Presentation Problem of the Day Problem of the Day.

1 CS 352 Introduction to Logic Design Lecture 4 Ahmed Ezzat Multi-level Gate Circuits and Combinational Circuit Design Ch-7 + Ch-8.

MATRIX FORM OF PRIM’S ALGORITHM. This network may be described using a Distance Matrix.

K-maps and Decoders Prof. Sin-Min Lee Department of Computer Science.

南亚和印度.

FAULT TREE ANALYSIS. NOTATION Series system System fails when either component fails Pump Failure Valve Failure P(system failure) = P(pump failure  valve.

Warm Up Problem of the Day Lesson Presentation Lesson Quizzes.

EET 1131 Unit 5 Boolean Algebra and Reduction Techniques

Matrix Multiplication

Parallel Lines and Proportional Parts

Combinations COURSE 3 LESSON 11-3

The Advanced Encryption Standard: Rijndael

BASIC & COMBINATIONAL LOGIC CIRCUIT

Digital Logic & Design Dr. Waseem Ikram Lecture 12.

CHAPTER 5 KARNAUGH MAPS 5.1 Minimum Forms of Switching Functions

Parallel Lines and Proportional Parts

Single Source Shortest Paths Bellman-Ford Algorithm

Introduction to Transportation Engineering

CSC 453 Database Systems Lecture

Fractional Factorial Design

AB AC AD AE AF 5 ways If you used AB, then, there would be 4 remaining ODD vertices (C, D, E and F) CD CE CF 3 ways If you used CD, then, there.

VLSI CAD Flow: Logic Synthesis, Placement and Routing Lecture 5

CUT SET TRANSFORMATION

Kruskal’s Algorithm AQR.

CSC 453 Database Systems Lecture

Design matrix Run A B C D E

Laws & Rules of Boolean Algebra

Computer Architecture

Presentation transcript:

FAULT TREE ANALYSIS: REALISTIC EXAMPLE, MINIMAL CUT SETS

Example: Primary Containment Instrument Gas System (Two trains each of a compressor, dryer, and receiver) PLANT INTAKE COMPRESSOR A COMPRESSOR B DRYER A DRYER B RCVR A RCVR B HEADER A HEADER B CROSS-TIE

1/2 2/2 Intake Back Leakage (from receivers) Compressor BDryer BReceiver B Compressor ADryer AReceiver A Intertie Valves Header A Header B Contamination (can disable both trains) Example: Primary Containment Instrument Gas System (Simplified block diagram)

FAULT TREE REPRESENTATION

* * e.g. relief valve stuck open * e.g. failure to allow flow through *

FAULT TREE REPRESENTATION * * e.g. relief valve stuck open * e.g. failure to allow flow through *

MINIMUM CUT SET A set of components that is sufficient to cause system failure, But would not be sufficient if any one event were removed Example In the preceding fault tree: Failure of Receiver A and Dryer B is sufficient to cause system failure But failure of Receiver A or Dryer B alone would not be sufficient

ALGORITHM FOR MINIMUM CUT SETS Finding minimal cut sets is computationally difficult (NP-complete!) Rules: 1.Each OR gate generates new rows in the table of cut sets (corresponding to new cut sets) 2.Each AND gate generates new columns in the table of cut sets (corresponding to additional elements in existing cut sets) After each of the above steps, you can: 3.Eliminate redundant elements that appear multiple times in a cut set 4.Eliminate non-minimal cut sets

A∩C A∩D A∩E B∩C B∩D B∩E C∩C C∩D C∩E 1 2∩3 A∩3 B∩3 C∩3 Rule 2 Rule 1 Example A BC C DE F GH I Rule 3 Rule 4 A∩D A∩E B∩D B∩E C minimal cut sets F∩D G∩D F∩H∩I G∩H∩I B∩D B∩E C F∩D G∩D F∩E G∩E B∩D B∩E C