Reliability Block Diagrams based Analysis: A Survey

Similar documents
An Informal introduction to Formal Verification

COEN6551: Formal Hardware Verification

Performance Analysis of ARQ Protocols using a Theorem Prover

Advanced Topics in LP and FP

Formalization of Ray Optics (Highlights)

Learning Goals of CS245 Logic and Computation

Formalization of Normal Random Variables

arxiv: v1 [cs.lo] 8 May 2015

Formal Reasoning about Systems Biology using Theorem Proving

arxiv: v1 [cs.lo] 7 Dec Department of Electrical and Computer Engineering,

Formal Reliability Analysis of Railway Systems Using Theorem Proving Technique

Formal Reliability Analysis of Combinational Circuits using Theorem Proving

Formal Verification of Mathematical Algorithms

CALCULUS I, SPRING Introduction

The Underlying Semantics of Transition Systems

Inf2D 06: Logical Agents: Knowledge Bases and the Wumpus World

Logic & Logic Agents Chapter 7 (& background)

Logic: Propositional Logic Truth Tables

COMP3702/7702 Artificial Intelligence Week 5: Search in Continuous Space with an Application in Motion Planning " Hanna Kurniawati"

Propositional Logic: Logical Agents (Part I)

The Formal Proof Susan Gillmor and Samantha Rabinowicz Project for MA341: Appreciation of Number Theory Boston University Summer Term

The LCF Approach to Theorem Proving

Logical Agents. Outline

Dynamic Semantics. Dynamic Semantics. Operational Semantics Axiomatic Semantics Denotational Semantic. Operational Semantics

Accurate Reliability Analysis of Combinational Circuits using Theorem Proving

Human-Readable Machine-Verifiable Proofs for Teaching Constructive Logic

Lecture Notes: Axiomatic Semantics and Hoare-style Verification

Deductive Verification

Propositional Logic: Logical Agents (Part I)

Economic Reliability Group Acceptance Sampling Plan for Truncated Life Test Having Weibull Distribution

Semantics and Pragmatics of NLP

Inductive Theorem Proving

Key Words: Lifetime Data Analysis (LDA), Probability Density Function (PDF), Goodness of fit methods, Chi-square method.

Formalization of Fault Trees in Higher-order Logic: A Deep Embedding Approach

SE 2FA3: Discrete Mathematics and Logic II. Teaching Assistants: Yasmine Sharoda,

A Short Introduction to Hoare Logic

Recursion and Intro to Coq

NPTEL Phase-II Video course on. Design Verification and Test of. Dr. Santosh Biswas Dr. Jatindra Kumar Deka IIT Guwahati

CME Project, Algebra Correlated to: Missouri Mathematics Course-Level Expectations 2007 (Algebra 2)

Formal Analysis of Continuous-time Systems using Fourier Transform

arxiv: v1 [cs.lo] 8 Jun 2018

Introduction to Metalogic

How to determine if a statement is true or false. Fuzzy logic deal with statements that are somewhat vague, such as: this paint is grey.

NICTA Advanced Course. Theorem Proving Principles, Techniques, Applications. Gerwin Klein Formal Methods

Bayesian Reliability Analysis: Statistical Challenges from Science-Based Stockpile Stewardship

DVClub Europe Formal fault analysis for ISO fault metrics on real world designs. Jörg Große Product Manager Functional Safety November 2016

23.1 Gödel Numberings and Diagonalization

PREDICATE LOGIC: UNDECIDABILITY AND INCOMPLETENESS HUTH AND RYAN 2.5, SUPPLEMENTARY NOTES 2

Proof Techniques (Review of Math 271)

Proofs of Correctness: Introduction to Axiomatic Verification

Logic - recap. So far, we have seen that: Logic is a language which can be used to describe:

What are the recursion theoretic properties of a set of axioms? Understanding a paper by William Craig Armando B. Matos

Integrated Math 3 Math 3 Course Description:

Introduction to Logic in Computer Science: Autumn 2006

Propositional Reasoning

Formal Verification of Tail Distribution Bounds in the HOL Theorem Prover

Intelligent Agents. Pınar Yolum Utrecht University

Lecture 11: Measuring the Complexity of Proofs

Software Verification using Predicate Abstraction and Iterative Refinement: Part 1

Informal Statement Calculus

Outline. Overview. Syntax Semantics. Introduction Hilbert Calculus Natural Deduction. 1 Introduction. 2 Language: Syntax and Semantics

Lecture 5 : Proofs DRAFT

Strong AI vs. Weak AI Automated Reasoning

02 The Axiomatic Method

Phases of Disaster Response. John Yeaw, Gavin Vanstone, Haochen Wu, Jordan Tyler

CITS2211 Discrete Structures Proofs

cis32-ai lecture # 18 mon-3-apr-2006

Propositional Logic Not Enough

Hoare Logic and Model Checking

Formalization of Birth-Death and IID Processes in Higher-order Logic

Last Time. Inference Rules

Examples: P: it is not the case that P. P Q: P or Q P Q: P implies Q (if P then Q) Typical formula:

THE LANGUAGE OF FIRST-ORDER LOGIC (FOL) Sec2 Sec1(1-16)

Write your own Theorem Prover

Formal methods in analysis

Changes in Ecosystems - Natural Events

Formal Stability Analysis of Control Systems

Logical Agents. Knowledge based agents. Knowledge based agents. Knowledge based agents. The Wumpus World. Knowledge Bases 10/20/14

Formal verification of IA-64 division algorithms

Logical Agents. Chapter 7

Proving simple set properties...

03 Review of First-Order Logic

Part 1: Logic and Probability

Decision Theory and the Logic of Provability

NONSTANDARD MODELS AND KRIPKE S PROOF OF THE GÖDEL THEOREM

Hoare Logic: Reasoning About Imperative Programs

Lectures on Computational Type Theory

CVO103: Programming Languages. Lecture 2 Inductive Definitions (2)

Classical Program Logics: Hoare Logic, Weakest Liberal Preconditions

RESOLUTION OVER LINEAR EQUATIONS AND MULTILINEAR PROOFS

A Little History Incompleteness The First Theorem The Second Theorem Implications. Gödel s Theorem. Anders O.F. Hendrickson

Tutorial on Mathematical Induction

Code Generation for a Simple First-Order Prover

Propositional Logic. Spring Propositional Logic Spring / 32

Applied Logic. Lecture 1 - Propositional logic. Marcin Szczuka. Institute of Informatics, The University of Warsaw

Arithmetic in Metamath. Case Study: Bertrand s Postulate

COMP219: Artificial Intelligence. Lecture 19: Logic for KR

Lecture Notes on Quantification

Systems of modal logic

Theorem. For every positive integer n, the sum of the positive integers from 1 to n is n(n+1)

Transcription:

Reliability Block Diagrams based Analysis: A Survey O. Hasan 1, W. Ahmed 1 S. Tahar 2 and M.S. Hamdi 3 1 National University of Sciences and Technology, Islamabad Pakistan 2 Concordia University, Montreal, Canada 3 Ahmed Bin Mohammed Military College, Doha, Qatar ICNAAM 2014 Rhodes, Greece

Outline q Reliability Block Diagrams q Analysis Techniques q Example: RBD based Analysis of a simple Oil and Gas Pipeline q Conclusions O. Hasan RBD based Analysis: A Survey 3

Reliability q A measure of the continuity of service q Probability that a system performs its intended function until some time t without failing q X: random variable that models the time to failure of the system q Commonly used Distributions Exponential Weibul O. Hasan RBD based Analysis: A Survey 4

O. Hasan RBD based Analysis: A Survey 5 Reliability Block Diagrams q Used to asses the reliability of a complex system q Partition the system into sub-blocks and connectors (RBD) q Find the failure rates of sub-blocks q Judge the failure characteristics of the overall system failure rates of individual components RBD configuration q The overall system failure happens if all the paths for successful execution fail q Add more parallelism to meet the reliability goals

O. Hasan RBD based Analysis: A Survey 6 Series Reliability Block Diagram I A 1 A 2 A 3 A N O q The overall system is reliable only if all of its components are functioning reliably q If A i (t) are the mutually independent events corresponding to i serially-connected components then

Parallel Reliability Block O. Hasan RBD based Analysis: A Survey 7 Diagrams I A 1 A 2 O q The overall system reliability mainly depends on the component with the maximum reliability q If A i (t) are the mutually independent events corresponding to i parallel-connected components then A N

O. Hasan RBD based Analysis: A Survey 8 Series-Parallel Reliability Block Diagrams A 1-1 A 1-2 A 1-N I A 2-1 A 2-2 A 2-N O A M-1 A M-2 A M-N q A combination of both series and parallel RBD

O. Hasan RBD based Analysis: A Survey 9 Parallel- Series Reliability Block Diagrams A 1-1 A 2-1 A N-1 I A 1-2 A 2-2 A N-2 O A 1-N A 2-N A N-M

O. Hasan RBD based Analysis: A Survey 10 Example: Reliability Analysis of Oil and Gas Pipelines q There are tens of thousands of miles long oil and gas pipelines around the world q Some of them aging and are becoming more and more susceptible to failures q Very important to rigorously analyze their reliability and thus plan timely replacements and maintenance

Methane Gas Leakage on the Deepwater Horizon oil rig April 2010 q Killed 11 workers q Destroyed and sank the rig q Caused millions of gallons of oil to pour into the Gulf of Mexico q Took three months to bring the situation under control q Damage to marine and wildlife habitats O. Hasan RBD based Analysis: A Survey 11

O. Hasan RBD based Analysis: A Survey 12 Reliability Analysis of Pipelines q Partitioning the given pipeline into segments and constructing its equivalent reliability block diagram (RBD)

O. Hasan RBD based Analysis: A Survey 13 RBD Analysis Techniques q Paper-and-Pencil Proof Methods q Simulation q Theorem Proving

Paper-and-Pencil Proof O. Hasan RBD based Analysis: A Survey 14 Methods q Construct a RBD of the given system on Paper q Analytically analyze the overall reliability of the given system on paper q Already verified RBD relationships q Distribution functions of the failure modeling random variables q Error Prone q Manual manipulation and simplification q Missing assumptions

O. Hasan RBD based Analysis: A Survey 15 Computer Simulations q Generate samples from the Exponential and Weibull random variables to model the reliabilities of the sub-modules q Compute the overall reliability of the given system based on the already verified RBD relationships q Error Prone q Pseudo random Numbers q Computer arithmetic q Numerical techniques

O. Hasan RBD based Analysis: A Survey 16 Inaccuracies in RBD based analysis q A severe limitation in the case of safety-critical applications like oil and gas pipelines q May endanger human and animal life q Lead to a significant financial loss

O. Hasan RBD based Analysis: A Survey 17 Theorem Proving Bridges the gap between Paper-and-pencil proof methods and simulation Paper-and-pencil Proof Methods Theorem Proving Simulation Shares their advantages As precise as a mathematical proof can be Computers are used for book-keeping Not as straightforward to use as simulation

O. Hasan RBD based Analysis: A Survey 18 Theorem Proving S ystem Properties Logic (Function) Logic (Theorem) Theorem Prover Form al proofs of the system properties

O. Hasan RBD based Analysis: A Survey 19 Logic q Study of drawing conclusions (reasoning) q Propositional logic Supports statements that can be true or false q First-order logic (Predicate logic) Quantification over variables ( : For all, : there exists) q Higher-order logic Quantification over sets and functions Propositional Logic Less expressive(-) Decidable(+) First-Order Logic Higher-Order Logic Very expressive(+) Undecidable(-)

O. Hasan RBD based Analysis: A Survey 20 Theorem Prover q A theorem prover consists of q A notation (Syntax) q A small set of fundamental axioms (facts) Example: ( A) A q A small set of deduction rules Example: Given (A B) and A, we can deduce B q Soundness is assured as every new theorem must be created from q The basic axioms and primitive inference rules q Any other already proved theorems (Theory Files)

Theorem Proving - Example: Natural Log of Product val LN_MUL = store_thm("ln_mul", (--` x y. 0 < x 0 < y (ln (x * y) = ln x + ln y)`--), REPEAT GEN_TAC THEN STRIP_TAC THEN ONCE_REWRITE_TAC[GSYM EXP_INJ] THEN REWRITE_TAC[EXP_ADD] THEN SUBGOAL_THEN (--`&0 < x * y`--) ASSUME_TAC THENL [MATCH_MP_TAC REAL_LT_MUL THEN ASM_REWRITE_TAC[], EVERY_ASSUM(fn th => REWRITE_TAC[ONCE_REWRITE_RULE[GSYM EXP_LN] th])]); [EXP_INJ] x y. (exp x = exp y) (x = y) [EXP_ADD] x y. exp (x + y) = exp x * exp y [EXP_LN] x. (exp (ln x) = x) 0 < x O. Hasan RBD based Analysis: A Survey 21

O. Hasan RBD based Analysis: A Survey 22 Formal Reliability Analysis - Requirements q Formalization of Probability Theory is the foremost requirement for reliability analysis q Formalization of Continuous Random Variables q Recursive Definitions for Reliability Block Diagrams Have to use a Higher-order Logic Theorem Prover

Formal Reliability Analysis of a Simple Oil and Gas Pipeline using Theorem Proving CICM 2014 q Formalization of Reliability in HOL q Formalization of Series RBD in HOL q Formal RBD based analysis of a simple pipeline q Generic expressions involving q any number of segments q arbitrary failure rates q All assumptions are explicitly available O. Hasan RBD based Analysis: A Survey 23

Summary Criteria Paperand-Pencil Proof Simulation Higher-orderlogic Proof Assistants Expressiveness Accuracy Automation? q The precision of results is very important while analyzing safety-critical domains q Theorem Proving can guarantee precise reliability analysis O. Hasan RBD based Analysis: A Survey 24

O. Hasan RBD based Analysis: A Survey 25 Future Recommendations q Formalization of other RBDs q Parallel, series-parallel and parallel-series q More case studies q Virtual Data Centers q More complex Pipelines

O. Hasan 26 Thanks! q For More Information q Visit our website http://save.seecs.nust.edu.pk q Contact osman.hasan@seecs.nust.edu.pk