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

Slides:



Advertisements
Similar presentations
ILO Turin Centre, November, The IUFs Transnational Company Work.
Advertisements

A. BobbioBertinoro, March 10-14, Dependability Theory and Methods 3. State Enumeration Andrea Bobbio Dipartimento di Informatica Università del Piemonte.
Academic Honesty Promoting the Legal and Ethical Use of Information by
TinyOS Tutorial, Part I Phil Levis et al. MobiSys 2003.
November 22, 2003DASER Conference. Copyright MIT, METS: Metadata Encoding & Transmission Standard.
WS Choreography v.0-1 Overview This is work-in-progress David Burdett, Commerce One 18 June 2003.
The Puzzle of WTO Safeguards and RTAs Joost Pauwelyn Duke University, Law School WTO Seminar on RTAs and the WTO Geneva, 14 November 2003.
TRACES TRAde Control and Expert System
Basic Wave Theory Review
1/10/20031 End-to-end QoS in the users' point of view ITU-T Workshop Geneva 1-3 October 2003 P-Y Hébert - ETSI.
Milano 25/2/20031 Bandwidth Estimation for TCP Sources and its Application Prepared for QoS IP 2003 R. G. Garroppo, S.Giordano, M. Pagano, G. Procissi,
M. Cooper Communication Skills Making Oral presentations.
/ department of mathematics and computer science TU/e eindhoven university of technology CEDEFOP workshop: Policy, Practice, Partnership: Getting to Work.
Introduction to Fuzzy Set Theory Weldon A. Lodwick
TEST PREPARATION Source: Rusty Haynes, The Facts For many colleges test scores are still the most important criterion following coursework and.
25 July Navigating Doors. 25 July Starting the Program A Doors shortcut icon is on the computer desktop Double-click the icon to start Doors.
Distributed AI an overview. D Goforth - COSC 4117, fall Why distributed AI? situated expert – the importance of general knowledge and incorporation.
28 July Doors Creating Time Zones. 28 July What is a Time Zone? A designated period of time in which access can be granted to a secure area.
The Central Processing Unit: What Goes on Inside the Computer
Algorithms and Data Structures Lecture III
Welcome to CMPE003 Personal Computer Concepts: Hardware and Software Winter 2003 UC Santa Cruz Instructor: Guy Cox.
Eigen-decomposition Techniques for Skywave Interference Detection in Loran-C Receivers Abbas Mohammed, Fernand Le Roux and David Last Dept. of Telecommunications.
April Privacy, Confidentiality and YOU! Putting the pieces together HIPAA.
Software for Traders real tools for real life September ITC Software. All Rights Reserved.
Mining for Patterns Based on Contingency Tables by KL-Miner First Experience Jan Rauch Milan Šimůnek (PhD. student) Václav Lín (student) University of.
Digital System Clocking:
© McClureTech Inc System Engineering Applying Architectural Principles to Complex System Development.
Julian Linford | ESRIN Grid Tutorial | December 20031/37 Progress of Grid Technology Development A Presentation for the ESRIN Grid Tutorial.
Lecture 23: Everything Else You Should Know (but won’t see on Exam 2)
February 19, Benefit Claims to Prior Applications under 35 U.S.C. §§ 119(e), 120, 121, and 365(c) Prepared by: Office of Patent Legal Administration.
SWCAP Budgeting July 30, 2003.
July 30, Pro Rata Budgeting. July 30, Pro Rata Budgeting Pro Rata Detail by Funds reports are available on the Internet no later than October.
David Evans CS201j: Engineering Software? University of Virginia Computer Science Lecture 3: Abstraction by Specification.
ASAS TN 2nd Workshop 6-8 October ADS-B Safety Analysis (ASA & GSA) Bob Darby EUROCONTROL ADS Programme ASAS Thematic Network Second Workshop 6-8.
Committed to Excellence May TACOM Tank-automotive & Armaments COMmand Recoil Reduction in the Barrett Model 82A1/XM107 and XM109 Frank Dindl U.S.
CompTest Residual Curing Stresses in Thin [0/90] Unsymmetric Composite Plates Marco Gigliotti°, Michael R. Wisnom, Kevin Potter Department of Aerospace.
25/11/20031 STF228 : User interoperability criteria P-Y Hébert Afutt - ETSI STF228 leader UG Plenary - January 26 th 2004.
Analog and Low-Power Design Lecture 20 (c) Lecture 20 Current Source Biasing and MOS Amplifier Design Michael L. Bushnell CAIP Center and WINLAB.
May 21, 2003Wu and Dai, ICDCS A Generic Distributed Broadcast Scheme in Ad Hoc Wireless Networks Jie Wu and Fei Dai Dept. of Comp. Sci. & Eng. Florida.
Constraint Satisfaction taking advantage of internal structure of states when paths don’t matter.
Andrea Bobbio Dipartimento di Informatica
A. BobbioReggio Emilia, June 17-18, Dependability & Maintainability Theory and Methods 5. Markov Models Andrea Bobbio Dipartimento di Informatica.
COE 444 – Internetwork Design & Management Dr. Marwan Abu-Amara Computer Engineering Department King Fahd University of Petroleum and Minerals.
SECURITY AND DEPENDABILITY OF COMPUTER SYSTEMS
Chapter 8 Continuous Time Markov Chains. Markov Availability Model.
6. Reliability Modeling Reliable System Design 2010 by: Amir M. Rahmani.
Markov Reward Models By H. Momeni Supervisor: Dr. Abdollahi Azgomi.
Reliable System Design 2011 by: Amir M. Rahmani
Reliability of Systems
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.
A. BobbioBertinoro, March 10-14, Dependability Theory and Methods Part 4: Fault-tree analysis Andrea Bobbio Dipartimento di Informatica Università.
Dependability Evaluation. Techniques for Dependability Evaluation The dependability evaluation of a system can be carried out either:  experimentally.
1 Software Testing and Quality Assurance Lecture 35 – Software Quality Assurance.
Sample Space Probability implies random experiments.
4. Dynamic reliability models Objectives Be able to find reliability of series, parallel, stand-by and shared load parallel systems, when the reliabilities.
1 Reliability Prediction A Quest for Reliable Parameters By Yair Shai.
1 Reliability Application Dr. Jerrell T. Stracener, SAE Fellow Leadership in Engineering EMIS 7370/5370 STAT 5340 : PROBABILITY AND STATISTICS FOR SCIENTISTS.
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.
By Behzad Akbari Tarbiat Modares University Spring 2009
Pisa, 11/25/2002Susanna Donatelli1 Heterogeneous model construction Susanna Donatelli Modelling and evaluation groups of the Dipartimento.
1 Component reliability Jørn Vatn. 2 The state of a component is either “up” or “down” T 1, T 2 and T 3 are ”Uptimes” D 1 and D 2 are “Downtimes”
Reliability Failure rates Reliability
1 3. System reliability Objectives Learn the definitions of a component and a system from a reliability perspective Be able to calculate reliability of.
Stracener_EMIS 7305/5305_Spr08_ Systems Reliability Modeling & Analysis Series and Active Parallel Configurations Dr. Jerrell T. Stracener, SAE.
EMIS 7300 SYSTEMS ANALYSIS METHODS FALL 2005
Most people will have some concept of what reliability is from everyday life, for example, people may discuss how reliable their washing machine has been.
Fault-Tolerant Computing Systems #5 Reliability and Availability2
Reliability Failure rates Reliability
Presentation transcript:

A. BobbioReggio Emilia, June 17-18, Dependability & Maintainability Theory and Methods 3. Reliability Block Diagrams Andrea Bobbio Dipartimento di Informatica Università del Piemonte Orientale, “A. Avogadro” Alessandria (Italy) - IFOA, Reggio Emilia, June 17-18, 2003

A. BobbioReggio Emilia, June 17-18, Model Types in Dependability Combinatorial models assume that components are statistically independent: poor modeling power coupled with high analytical tractability.  Reliability Block Diagrams, FT, …. State-space models rely on the specification of the whole set of possible states of the system and of the possible transitions among them.  CTMC, Petri nets, ….

A. BobbioReggio Emilia, June 17-18, Reliability Block Diagrams  Each component of the system is represented as a block;  System behavior is represented by connecting the blocks;  Failures of individual components are assumed to be independent;  Combinatorial (non-state space) model type.

A. BobbioReggio Emilia, June 17-18, Reliability Block Diagrams (RBDs)  Schematic representation or model;  Shows reliability structure (logic) of a system;  Can be used to determine dependability measures;  A block can be viewed as a “switch” that is “closed” when the block is operating and “open” when the block is failed;  System is operational if a path of “closed switches” is found from the input to the output of the diagram.

A. BobbioReggio Emilia, June 17-18, Reliability Block Diagrams (RBDs) Can be used to calculate: –Non-repairable system reliability given:  Individual block reliabilities (or failure rates);  Assuming mutually independent failures events. –Repairable system availability given:  Individual block availabilities (or MTTFs and MTTRs);  Assuming mutually independent failure and restoration events;  Availability of each block is modeled as 2-state Markov chain.

A. BobbioReggio Emilia, June 17-18, Series system of n components. Components are statistically independent Define event E i = “component i functions properly.” Series system in RBD A1A1A2A2AnAn P(E i ) is the probability “component i functions properly”  the reliability R i (t) (non repairable)  the availability A i (t) (repairable)

A. BobbioReggio Emilia, June 17-18, Reliability of Series system Series system of n components. Components are statistically independent Define event E i = "component i functions properly.” A1A1A2A2AnAn Denoting by R i (t) the reliability of component i Product law of reliabilities:

A. BobbioReggio Emilia, June 17-18, Series system with time-independent failure rate Let i be the time-independent failure rate of component i. Then: The system reliability Rs(t) becomes: R s (t) = e - s t with s =  i i=1 n R i (t) = e - i t 1 1 MTTF = —— = ———— s  i i=1 n

A. BobbioReggio Emilia, June 17-18, Availability for Series System Assuming independent repair for each component, where A i is the (steady state or transient) availability of component i

A. BobbioReggio Emilia, June 17-18, Series system: an example

A. BobbioReggio Emilia, June 17-18, Series system: an example

A. BobbioReggio Emilia, June 17-18, Improving the Reliability of a Series System Sensitivity analysis:  R s R s S i = ———— = ————  R i R i The optimal gain in system reliability is obtained by improving the least reliable component.

A. BobbioReggio Emilia, June 17-18, The part-count method It is usually applied for computing the reliability of electronic equipment composed of boards with a large number of components. Components are connected in series and with time- independent failure rate.

A. BobbioReggio Emilia, June 17-18, The part-count method

A. BobbioReggio Emilia, June 17-18, Redundant systems When the dependability of a system does not reach the desired (or required) level:  Improve the individual components;  Act at the structure level of the system, resorting to redundant configurations.

A. BobbioReggio Emilia, June 17-18, Parallel redundancy A system consisting of n independent components in parallel. It will fail to function only if all n components have failed. E i = “The component i is functioning” E p = “the parallel system of n component is functioning properly.” A1A1 AnAn

A. BobbioReggio Emilia, June 17-18, Parallel system Therefore :

A. BobbioReggio Emilia, June 17-18, Parallel redundancy F i (t) = P (E i ) Probability component i is not functioning (unreliability) R i (t) = 1 - F i (t) = P (E i ) Probability component i is functioning (reliability) A1A1 AnAn — F p (t) =  F i (t) i=1 n R p (t) = 1 - F p (t) = 1 -  (1 - R i (t)) i=1 n

A. BobbioReggio Emilia, June 17-18, component parallel system For a 2-component parallel system: F p (t) = F 1 (t) F 2 (t) R p (t) = 1 – (1 – R 1 (t)) (1 – R 2 (t)) = = R 1 (t) + R 2 (t) – R 1 (t) R 2 (t) A1A1 A2

A. BobbioReggio Emilia, June 17-18, component parallel system: constant failure rate For a 2-component parallel system with constant failure rate: R p (t) = A1A1 A2 e - 1 t + e - 2 t – e - ( ) t MTTF = —— + —— – ————

A. BobbioReggio Emilia, June 17-18, Parallel system: an example

A. BobbioReggio Emilia, June 17-18, Partial redundancy: an example

A. BobbioReggio Emilia, June 17-18, Availability for parallel system Assuming independent repair, where A i is the (steady state or transient) availability of component i.

A. BobbioReggio Emilia, June 17-18, Series-parallel systems

A. BobbioReggio Emilia, June 17-18, System vs component redundancy

A. BobbioReggio Emilia, June 17-18, Component redundant system: an example

A. BobbioReggio Emilia, June 17-18, Is redundancy always useful ?

A. BobbioReggio Emilia, June 17-18, Stand-by redundancy A B The system works continuously during 0 — t if: a)Component A did not fail between 0 — t b)Component A failed at x between 0 — t, and component B survived from x to t. x 0 t A B

A. BobbioReggio Emilia, June 17-18, Stand-by redundancy A B x 0 t A B

A. BobbioReggio Emilia, June 17-18, A B Stand-by redundancy (exponential components)

A. BobbioReggio Emilia, June 17-18, Majority voting redundancy A1A1 A2 A3 Voter

A. BobbioReggio Emilia, June 17-18, :3 majority voting redundancy A1A1 A2 A3 Voter