A. BobbioBertinoro, March 10-14, 20031 Dependability Theory and Methods Part 4: Fault-tree analysis Andrea Bobbio Dipartimento di Informatica Università.

Slides:

Advertisements

Similar presentations

A. BobbioBertinoro, March 10-14, Dependability Theory and Methods 3. State Enumeration Andrea Bobbio Dipartimento di Informatica Università del Piemonte.

Advertisements

Paolo Atzeni - Pierluigi Del Nostro Università Roma Tre Dipartimento di Informatica e Automazione T-Araneus: Management of temporal data-intensive Web.

1 Open-charm and J/ψ production at the ALICE experiment Pietro Cortese Università del Piemonte Orientale and INFN Alessandria, Italy on behalf of the ALICE.

IEC – IEC Presentation G.M. International s.r.l

CT455: Computer Organization Logic gate

Exploiting decision theory for supporting therapy selection in computerized clinical guidelines Stefania Montani, Paolo Terenziani, Alessio Bottrighi DI,

A. BobbioReggio Emilia, June 17-18, Dependability & Maintainability Theory and Methods 3. Reliability Block Diagrams Andrea Bobbio Dipartimento di.

Prediction from Quasi-Random Time Series Lorenza Saitta Dipartimento di Informatica Università del Piemonte Orientale Alessandria, Italy.

The File Mover: An Efficient Data Transfer System for Grid Applications C. Anglano, M. Canonico Dipartimento di Informatica Universita' del Piemonte Orientale,

Binary Decision Diagrams1 BINARY DECISION DIAGRAMS.

A. BobbioBertinoro, March 10-14, Dependability Theory and Methods 5. Markov Models Andrea Bobbio Dipartimento di Informatica Università del Piemonte.

A. BobbioReggio Emilia, June 17-18, Dependability & Maintainability Theory and Methods Part 2: Repairable systems: Availability Andrea Bobbio Dipartimento.

Safety Analysis – A quick introduction RTS February 2006 Anders P. Ravn Aalborg University.

Safety Assessment (Fault Trees) ITV Model-based Analysis and Design of Embedded Software Techniques and methods for Critical Software Anders P. Ravn Aalborg.

Summary and Safety Assessment mMIC-SFT November 2003 Anders P. Ravn Aalborg University.

A. BobbioBertinoro, March 10-14, Dependability Theory and Methods Part 1: Introduction and definitions Andrea Bobbio Dipartimento di Informatica.

Chapter 3: Set Theory and Logic

APPLIED TO ONLINE SEARCHING © Janet Tillman/The Master’s College, , permission is granted for non-profit educational use; any reproduction or.

What is Fault Tree Analysis?

SISTEMA Example Two. Schneider Electric – Areva D Acquisition – June Example 2: Safe stopping of a PLC-driven drive with emergency stop – Category.

FaultTree+ V11 Summary of Fault and Event Tree Methods

Isograph Reliability Software RiskVu V3. Isograph Reliability Software ESSM – The first risk monitor ? Essential Systems Status Monitor Installed at Heysham.

Boolean Algebra and Logic Gates CE 40 B 18 June 2003.

Chapter 4 The Building Blocks: Binary Numbers, Boolean Logic, and Gates.

A. BobbioBertinoro, March 10-14, Dependability Theory and Methods 2. Reliability Block Diagrams Andrea Bobbio Dipartimento di Informatica Università.

Pisa, 11/25/2002Susanna Donatelli1 Modelling process and heterogeneous model construction Susanna Donatelli Modelling and evaluation groups.

Y3AR 6 PROJECT By sam knifton. BINARY Binary is basically two number that make a simple equation. These two numbers are 1 and 0 These are some examples.

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

Pisa, 11/25/2002Susanna Donatelli1 Heterogeneous model construction Susanna Donatelli Modelling and evaluation groups of the Dipartimento.

February 23, Announcements ACSL – March 9 Digital Electronics – 2 Graph Theory – 2 Boolean Algebra – 1 USACO – March

ACOE1611 Combinational Logic Circuits Reference: M. Mano, C. Kime, “Logic and Computer Design Fundamentals”, Chapter 2.

Product & Technology Quality. Excellence. Support SIL Explanation 27.JAN 2006 Automation & Safety.

Computer Architecture and Organization Unit -1. Digital Logic Circuits – Logic Gates – Boolean Algebra – Map Simplification – Combinational Circuits –

TUGAS K3 DALAM INDUSTRI KIMIA

Lecture 4 Introduction to Boolean Algebra. Binary Operators In the following descriptions, we will let A and B be Boolean variables and define a set of.

ECOMPOSE: development of Executable COntent in Medicine using Proprietary and Open Standards Engineering Dipartimento di Informatica, Universita’ del Piemonte.

Logic Gates M. AL-Towaileb1. Introduction Boolean algebra is used to model the circuitry of electronic devices. Each input and each output of such a device.

How to develop E/E/PESs to IEC 61508?

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

Unit II Fundamentals of Logic Design By Roth and Kinney.

DIGITAL ELECTRONICS. Everything in digital world is based on binary system. Numerically it involves only two symbols 0 or 1. –0 = False = No –1 = True.

DEPENDABILITY ANALYSIS (towards Networked Information Systems) Ester Ciancamerla, Michele Minichino ENEA {ciancamerlae, In.

© 2014 Cengage Learning Engineering. All Rights Reserved. 1 FUNDAMENTALS OF LOGIC DESIGN SEVENTH EDITION UNIT 3 Boolean Algebra (Continued)

Fault Tree Analysis of the HERMES CubeSat

Lecture 21: Combinatorial Circuits II Discrete Mathematical Structures: Theory and Applications.

Prof. Enrico Zio Fault tree analysis Prof. Enrico Zio Politecnico di Milano Dipartimento di Energia.

Fault Tree Analysis for the BLEDP Student meeting Vegard Joa Moseng.

Process of Diagnosing a Dynamic System Lab Seminar June 19th, 2007 Seung Ki Shin.

A fault tree – Based Bayesian network construction for the failure rate assessment of a complex system 46th ESReDA Seminar May 29-30, 2014, Politecnico.

Programmable Logic Controller

Logic Gates Review. Logic Gates OR gate – 1 if either input is 1 – 0 if they both are 0.

Lecture 1 Gunjeet kaur Dronacharya group of institutions.

Hoda Roodaki Boolean Algebra Hoda Roodaki

GCSE OCR Computing A451 Binary logic Computing hardware 6.

Questions Describe the following gates

Fault Tree Analysis Based on Dynamic Uncertain Causality Graph

Reliability targets in functional specifications

Logic Gates, Boolean Algebra and Karnaugh Maps

ECE/CS 352 Digital Systems Fundamentals

How Boolean logic is implemented

Tool for investigations

Lecture 20: Combinatorial Circuits I

Chapter 10.3 and 10.4: Combinatorial Circuits

Faculty of Cybernetics, Statistics and Economic Informatics

Fundamentals of Logic Design, 7th Edition Roth/Kinney

DIGITAL ELECTRONICS AND LOGIC GATES. ANALOG SIGNAL:- Analog signal is continuous time varying current or voltage signal.

Computer Architecture

Agenda Lecture Content: Combinatorial Circuits Boolean Algebras

Presentation transcript:

A. BobbioBertinoro, March 10-14, Dependability Theory and Methods Part 4: Fault-tree analysis Andrea Bobbio Dipartimento di Informatica Università del Piemonte Orientale, “A. Avogadro” Alessandria (Italy) - Bertinoro, March 10-14, 2003

Elements of logic algebra

Logic algebra and Venn diagrams

 Events are binary events (working/non-working);  Events are statistically independent;  Relationships between events and causes are represented by logical AND and OR (Boolean) gates;  The root of the FT is the catastrophic undesired event called the Top Event (TE). Fundamental assumptions for FTA

A. BobbioBertinoro, March 10-14, Case study: a PLC architecture

A. BobbioBertinoro, March 10-14, Case study: a PLC architecture The considered failure rates for the elementary blocks are reported in the Table.

A. BobbioBertinoro, March 10-14, PLC architecture: FTA

A. BobbioBertinoro, March 10-14, Safety and dependability measures Safety assessment of the control system according to IEC (Functional safety of electrical/electronic/ programmable electronic safety-related systems)  SIL requirements (IEC 61508);  Unreliability versus time;  Safe Mission Time (SMT);  Mean Time To Failure;  Critical failure path (mcs).

A. BobbioBertinoro, March 10-14, FT Critical cuts The FT has 59 MCS, one of order 1 (the voter) and the remaining 58 of order 2.