CUT SET TRANSFORMATION

Slides:



Advertisements
Similar presentations
Excel Spread Sheet- plug in dates along top row skipping column A.
Advertisements

SEL3053: Analyzing Geordie Lecture 13. Hierarchical cluster analysis 2 - cluster tree construction Lecture 12 introduced hierarchical cluster analysis,
Truth Tables How to Make and Use. Making a Truth Table To determine the number of rows other than the heading row. To determine the number of rows other.
Walks, Paths and Circuits Walks, Paths and Circuits Sanjay Jain, Lecturer, School of Computing.
1 Fault-Tolerant Computing Systems #6 Network Reliability Pattara Leelaprute Computer Engineering Department Kasetsart University
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.
1.2 Row Reduction and Echelon Forms
Linear Equations in Linear Algebra
Linear System of Equations MGT 4850 Spring 2008 University of Lethbridge.
Lecture 9 Hidden Markov Models BioE 480 Sept 21, 2004.
Transportation Models Transportation problem is about distribution of goods and services from several supply locations to several demand locations. Transportation.
Normalization I.
Chapter 5 Normalization Transparencies © Pearson Education Limited 1995, 2005.
Phylogenetic Networks of SNPs with Constrained Recombination D. Gusfield, S. Eddhu, C. Langley.
ECE Synthesis & Verification 1 ECE 667 ECE 667 Synthesis and Verification of Digital Systems Exact Two-level Minimization Quine-McCluskey Procedure.
A Guide to SQL, Seventh Edition. Objectives Understand, create, and drop views Recognize the benefits of using views Grant and revoke user’s database.
Sensitivity Analysis A systematic way of asking “what-if” scenario questions in order to understand what outcomes could possibly occur that would affect.
What is Fault Tree Analysis?
Basics of Fault Tree and Event Tree Analysis Supplement to Fire Hazard Assessment for Nuclear Engineering Professionals Icove and Ruggles (2011) Funded.
MMG508.  Access Types  Tables  Relational tables  Queries  Stored database queries  Forms  GUI forms for data entry/display  Reports  Reports.
Risk Assessment and Probabilistic Risk Assessment (PRA) Mario. H. Fontana PhD.,PE Research Professor Arthur E. Ruggles PhD Professor The University of.
Theory of Computing Lecture 10 MAS 714 Hartmut Klauck.
Circuit, State Diagram, State Table
Normalization. 2 Objectives u Purpose of normalization. u Problems associated with redundant data. u Identification of various types of update anomalies.
Normalization Transparencies
Quine-McCluskey (Tabular) Minimization Two step process utilizing tabular listings to: Identify prime implicants (implicant tables) Identify minimal PI.
Normalization Well structured relations and anomalies Normalization First normal form (1NF) Functional dependence Partial functional dependency Second.
Lecture 5 Normalization. Objectives The purpose of normalization. How normalization can be used when designing a relational database. The potential problems.
Chapter 10 Normalization Pearson Education © 2009.
Word : Let F be a field then the expression of the form a 1, a 2, …, a n where a i  F  i is called a word of length n over the field F. We denote the.
Sensitivity Analysis A systematic way of asking “what-if” scenario questions in order to understand what outcomes could possibly occur that would affect.
COSC 2007 Data Structures II
Graphs Upon completion you will be able to:
5.2 Day One Probability Rules. Learning Targets 1.I can describe a probability model for a chance process. 2.I can use basic probability rules, including.
Copyright © 2007 Ramez Elmasri and Shamkant B. Navathe Slide
ELEC692 VLSI Signal Processing Architecture Lecture 12 Numerical Strength Reduction.
ENGM 631 Maximum Flow Solutions. Maximum Flow Models (Flow, Capacity) (0,3) (2,2) (5,7) (0,8) (3,6) (6,8) (3,3) (4,4) (4,10)
1 1.2 Linear Equations in Linear Algebra Row Reduction and Echelon Forms © 2016 Pearson Education, Ltd.
MATRIX FORM OF PRIM’S ALGORITHM. This network may be described using a Distance Matrix.
1 Pertemuan 10 Using Type Matakuliah: U0344 / DESKTOP 1 Tahun: 2006.
FAULT TREE ANALYSIS: REALISTIC EXAMPLE, MINIMAL CUT SETS.
Normalization.
Making a JSON file.
AVL Tree Example: Insert 14, 17, 11, 7, 53, 4, 13 into an empty AVL tree
Accsess 2013 Creating Database.
Extra: B+ Trees CS1: Java Programming Colorado State University
Linear Algebra Lecture 4.
Lecture 12 Algorithm Analysis
Introduction to Database Management System
Minimum Spanning Tree.
Chapter 1 Minitab Recipe Card
Graphs Chapter 11 Objectives Upon completion you will be able to:
Normalization Dale-Marie Wilson, Ph.D..
Objective: Today we will investigate the ‘magic’ in magic squares.
Linear Equations in Linear Algebra
Dynamic Programming Computation of Edit Distance
Lecture 12 Algorithm Analysis
Linear Algebra Lecture 37.
Discrete Math 2 Shortest Paths Using Matrix
February 2, February 2,
Discrete Math 2 Shortest Path Using Matrix

Simple Graphs: Connectedness, Trees
Lecture 12 Algorithm Analysis
Linear Equations in Linear Algebra
AVL Tree Example: Insert 14, 17, 11, 7, 53, 4, 13 into an empty AVL tree
Database.
“Easy” Integer Programming Problems: Network Flow Problems

Presentation transcript:

CUT SET TRANSFORMATION TOP TOP OR AND AND AND AND 1 Component Cut Sets 2 Component Cut Sets 3 Component Cut Sets 4 Component Cut Sets 5 Component Cut Sets

DEFINITIONS: Cut set Minimal Cut Set Path Set Minimal Path Set A Cut set is a collection of basic events; if all theses basic events occur, the top event is guaranteed to occur. Minimal Cut Set A minimal cut set is such that if any basic event is removed from the set, the remaining events collectively are no longer a cut set. Path Set A path set is a collection of basic events; if none of the events in the sets occur, the top event is guaranteed not to occur. Minimal Path Set A minimal path set is a path set such that if any basic event is removed from the set, the remaining events collectively are no longer a path set.

1 2 4 3 5 6 [ Example ] Minimum Cut Sets OR 1 AND OR OR 2 OR 4 OR 3 5 6 Minimum Cut Sets {1},{2,4},{2,5},{2,6},{3,4},{3,5},{3,6} i.e. {1,2,3} and {1,4,5,6} are the minimum Path Sets

PROCEDURE FOR FINDING CUT SETS 1) Uniquely identify all gates and basic events. 2) Resolve all gates into basic events. 3) Remove duplicate events within sets. 4) Delete all supersets (sets that contain another set as a subset).

STEP 1: TOP Event Fault Event 1 Fault Event 2 BASIC Event 1 Fault D BASIC Event 1 Fault Event 1 BASIC Event 2 BASIC Event 4 C 1 2 4 BASIC Event 2 BASIC Event 3 2 3 SAMPLE FAULT TREE

STEP 2: The second step is to resolve all the gates into BASIC events. This is done in a matrix format, beginning with the TOP event and proceeding through the matrix until all gates are resolved. Gates are resolved by replacing them in the matrix with their inputs. The TOP event is always the first entry in the matrix and is entered in the first column of the first row . There are two rules for entering the remaining information in the matrix: the OR-gate rule, and the AND-gate rule.

The OR-gate rule: When resolving an OR gate in the matrix, the first input of the OR gate replaces the gate identifier in the matrix, and all other inputs to the OR gate are inserted in the next available row, one input per row. The next available row means the next empty row where the OR gate appeared, these entries must be entered (repeated) in all the rows that contain the gate’s inputs. The AND-gate rule: When resolving an AND gate in the matrix, the first input to the AND gate replaces the gate identifier in the matrix, and the other inputs to the AND gate are inserted in the next available column, one input per column, on the same row that the AND gate appeared on.

MATRIX FOR RESOLVING GATES IN SAMPLE FAULT TREE STEP 2: (b) (a) MATRIX FOR RESOLVING GATES IN SAMPLE FAULT TREE

MATRIX FOR RESOLVING GATES IN SAMPLE FAULT TREE STEP 2:(續1) (d) (c) MATRIX FOR RESOLVING GATES IN SAMPLE FAULT TREE

MATRIX FOR RESOLVING GATES IN SAMPLE FAULT TREE STEP 2:(續2) (f) (e) MATRIX FOR RESOLVING GATES IN SAMPLE FAULT TREE

STEP 3: set 1: 1, 2, 2 1, 2 set 2: 1, 2, 4 1, 2, 4 set 3: 1, 2, 3 1, 2, 3 set 4: 1, 3, 4 1, 3, 4 STEP 4: minimum cut sets: {1, 2}, {1, 3, 4}

Path Sets: A B B 1 1 D D D 2 4 C C 1 1 2 4 2 4 C 2 3 2 3 {1} {2,4} {2,3}