+ All Categories
Home > Documents > Fault Tree Analysis

Fault Tree Analysis

Date post: 07-Jan-2016
Category:
Upload: elpida
View: 64 times
Download: 3 times
Share this document with a friend
Description:
Fault Tree Analysis. Part 12 – Redundant Structure and Standby Units. Active Redundancy. The redundancy obtained by replacing the important unit with two or more units operating in parallel. Passive Redundancy. - PowerPoint PPT Presentation
54
Fault Tree Analysis Part 12 – Redundant Structure and Standby Units
Transcript
Page 1: Fault Tree Analysis

Fault Tree Analysis

Part 12 – Redundant Structure and Standby Units

Page 2: Fault Tree Analysis

Active Redundancy

The redundancy obtained by replacing the important unit with two or more units operating in parallel.

Page 3: Fault Tree Analysis

Passive Redundancy

The reserve units can also be kept in standby in such a way that the first of them is activated when the original unit fails, the second is activated when the first reserve unit fails, and so on. If the reserve units carry no load in the waiting period before activation, the redundancy is called passive. In the waiting period, such a unit is said to be in cold standby.

Page 4: Fault Tree Analysis

Partly-Loaded Redundancy

The standby units carry a weak load.

Page 5: Fault Tree Analysis

Cold Standby, Perfect Switching, No Repairs

Page 6: Fault Tree Analysis

Life Time of Standby System

The mean time to system failure

n

iiTT

1

n

iis MTTFMTTF

1

Page 7: Fault Tree Analysis

Exact Distribution of Lifetime

If the lifetimes of the n components are independent and exponentially distributed with the same failure rate λ. It can be shown that T is gamma distributed with parameters n and λ. The survivor function is

tn

k

k

s ek

ttR

1

0 !

)()(

Page 8: Fault Tree Analysis

Approximate Distribution of Lifetime

Assume that the lifetimes are independent and identically distributed with mean time to failure μ and standard deviation σ. According to Lindeberg-Levy’s central limit theorem, T will be asymptotically normally distributed with mean nμ and variance nσ^2.

Page 9: Fault Tree Analysis

Cold Standby, Imperfect Switching, No Repairs

Page 10: Fault Tree Analysis

2-Unit System

• A standby system with an active unit (unit 1) and a unit in cold standby. The active unit is under surveillance by a switch, which activates the standby unit when the active unit fails.

• Let be the failure rate of unit 1 and unit 2 respectively; Let (1-p) be the probability that the switching is successful.

21,

Page 11: Fault Tree Analysis

Two Disjoint Ways of Survival

1. Unit 1 does not fail in (0, t], i.e.

2. Unit 1 fails in the time interval (τ, τ+dτ], where 0<τ<t. The switch is able to activate unit 2. Unit 2 is activated at time τ and does not fail in the time interval (τ,t].

tT 1

Page 12: Fault Tree Analysis

Probabilities of Two Disjoint Events

• Event 1:

• Event 2:

tetT 11Pr

depetTt t 12

10

)(2 )1(Pr

Unit 1 failsSwitching successful

Unit 2 working afterwards

Page 13: Fault Tree Analysis

System Reliability

)()1(

)( 121

21

1

21

ttts ee

petR

ts etptR

)1(1)(

21

Page 14: Fault Tree Analysis

Mean Time to Failure

210

1)1(

1)(

pdttRMTTF ss

Page 15: Fault Tree Analysis

Partly-Loaded Redundancy, Imperfect Switching, No

Repairs

Page 16: Fault Tree Analysis

Two-Unit System

Same as before except unit 2 carries a certain load before it is activated. Let denote the failure rate of unit 2 while in partly-loaded standby.

0

Page 17: Fault Tree Analysis

Two Disjoint Ways of Survival

1. Unit 1 does not fail in (0, t], i.e.

2. Unit 1 fails in the time interval (τ, τ+dτ], where 0<τ<t. The switch is able to activate unit 2. Unit 2 does not fail in (0, τ], is activated at time τ and does not fail in the time interval (τ,t].

tT 1

Page 18: Fault Tree Analysis

Probabilities of Two Disjoint Events

• Event 1:

• Event 2:

tetT 11Pr

deepetTt t 102

10

)(2 )1(Pr

Unit 1 failsat τSwitching

successful

Unit 2 still working after τ Unit 2 working

in (0, τ]

Page 19: Fault Tree Analysis

System Reliability

][)1(

)(

0

)(

210

1

210

1021 ttts ee

petR

tts tepetR 21

1

021

)1()(

0

Page 20: Fault Tree Analysis

Mean Time to Failure

)()1(

1

)(

012

1

1

0

p

dttRMTTF ss

Page 21: Fault Tree Analysis

Cold Standby, Perfect Switching, With Repairs

Page 22: Fault Tree Analysis

Possible States of a 2-Unit System with Cold Standby and

Perfect SwitchingSystem Unit A Unit B

4 O S

3 F O

2 S O

1 O F

0 F F

Page 23: Fault Tree Analysis

State Space Diagram

0

1

2

34A

A

B

B

A

B

Page 24: Fault Tree Analysis

State Equations

)(

)(

)(

)(

)(

00

)(000

000

00)(0

00

)(

)(

)(

)(

)(

4

3

2

1

0

4

3

2

1

0

tP

tP

tP

tP

tP

tP

tP

tP

tP

tP

AB

AAB

AB

BBA

BA

Page 25: Fault Tree Analysis

Eliminating the Failed State

)(

)(

)(

)(

)(

00

)(000

000

00)(0

00

)(

)(

)(

)(

)(

4

3

2

1

0

4

3

2

1

0

tP

tP

tP

tP

tP

tP

tP

tP

tP

tP

AB

AAB

AB

BBA

BA

Page 26: Fault Tree Analysis

Laplace Transform

• Substitute s=0

• Note that

1

0

0

0

)0(P

)0(P

)0(P

)0(P

00

)(00

00

00)(

4

3

2

1

AB

AAB

AB

BBA

)()(Pi tPs iL

Page 27: Fault Tree Analysis

Solution

BBAABA

A

A

B

A

BA

A

AB

A

AB

A

BA

A

B

B

BA

P

PP

PPP

PPP

PP

)0(

)0(1)0(

)0()0()0(

)0()0()0(

)0()0(

1

14

134

123

12

Page 28: Fault Tree Analysis

Mean Time to Failure

0

00

00

)(

)()(

)()(

dttR

dttRttR

dttRtdtttfMTTF

Page 29: Fault Tree Analysis

Mean Time to Failure

• Take Laplace transform of R(t)

• Substitute s=0

dtetRs st

0)()(R

MTTFdttR

0)()0(R

Page 30: Fault Tree Analysis

Mean Time to Failure

BA

BAB

B

SMTTF

1111

)0(P)0(P)0(P)0(P

)0(sR

B

A

BA

4321

Page 31: Fault Tree Analysis

Cold Standby, Perfect Switching, With Repairs,A Main Operating Unit

Page 32: Fault Tree Analysis

Possible States

System Unit A

(Main Unit)

Unit B

4 O S

3 F O

2 S O

1 O F

0 F F

Page 33: Fault Tree Analysis

State Space Diagram

0

34A

BA

Page 34: Fault Tree Analysis

State Equations

)(

)(

)(

)(0

0

)(

)(

)(

4

3

0

4

3

0

tP

tP

tP

tP

tP

tP

AA

AAB

B

Where

1)()()( 430 tPtPtP

Page 35: Fault Tree Analysis

Steady State Probabilities

4

3

0

)(0

0

0

0

0

P

P

P

AA

AAB

B

Page 36: Fault Tree Analysis

Availability and Unavailability

43

4

3

0

PPA

P

P

PQ

ABABA

AB

ABABA

A

ABABA

BA

Page 37: Fault Tree Analysis

Eliminate Failed State from State Equations

)(

)(

)(

)(0

0

)(

)(

)(

4

3

0

4

3

0

tP

tP

tP

tP

tP

tP

AA

AAB

B

Where

1)()()( 430 tPtPtP

Page 38: Fault Tree Analysis

Treating State 0 as An Absorbing State

• Take Laplace transform and let s=0

• Solution

1

0

)0(P

)0(P)(

4

3

AA

AAB

BA

A

A

B

1)0(P

1)0(P

4

3

Page 39: Fault Tree Analysis

Mean Times to Failure and to Repair

• Mean time to failure

• Mean time to repairBA

A

BA

SMTTF

11

)0(P)0(P)0(R 43

1

SMTTR

Page 40: Fault Tree Analysis

Cold Standby, Imperfect Switching, With Repairs,A Main Operating Unit

Page 41: Fault Tree Analysis

State Space Diagram

0

34Ap )1(

B

A

Ap

Page 42: Fault Tree Analysis

Steady State Probabilities

4

3

0

)1()(0

0

0

0

P

P

P

p

p

AA

AAB

AB

Page 43: Fault Tree Analysis

Availability and Unavailability

43

4

3

0

)1(

)1(

)1(

)1(

PPA

ppP

pp

pP

pp

pPQ

ABAAABA

AB

ABAAABA

A

ABAAABA

AABA

Page 44: Fault Tree Analysis

Mean Time to Failure

)(

)1(

)0(P)0(P)0(R 43

ABA

ABA

S

p

p

MTTF

Page 45: Fault Tree Analysis

Partly-Loaded Standby, Perfect Switching, With

Repairs,A Main Operating Unit

Page 46: Fault Tree Analysis

Possible States of a 2-Unit System with Partly-Loaded

Standby and Perfect SwitchingSystem Unit A Unit B

4 O S

3 F O

2 S O

1 O F

0 F F

Page 47: Fault Tree Analysis

State Space Diagram

0

1

34A

A

B

SB

A

Page 48: Fault Tree Analysis

Steady State Probabilities

1

0

0

0

0

)(0

)(00

00

0

4310

4

3

1

0

PPPP

P

P

P

P

SBAA

AAB

SBA

BA

Page 49: Fault Tree Analysis

L Spares, With Replacements and Repairs

Page 50: Fault Tree Analysis

State Space Diagram

0

1

2 2j

12 j

22 j 2L

12 L 12 L

Page 51: Fault Tree Analysis

Notation

• State 2j (j = 0, 1, …,L): A total of j spare units are in a repair queue, and (L-j) spares are normal. A failed unit in the system is being replaced by a normal spared unit, the system is working.

• State 2j+1 (j = 0, 1, …, L-1): A total of j spare units are in a repair queue, and (L-j) spares are normal. A failed unit in the system is being replaced by a normal spared unit, the system does not work.

• State 2L+1: All spares are in a repair queue. A failed unit in the system is under priority repair. This is a type of quasi-replacement.

Page 52: Fault Tree Analysis

Notation

• λ:

Constant failure rate

• μ:

Constant repair rate

• ε:

Constant replacement rate

Page 53: Fault Tree Analysis

Steady-State State Equations

1

0

),2,1(0)(

)1,,1,0(0

0

12

0

122

22212

122

20

L

jj

LL

jjj

jj

P

PP

LjPPP

LjPP

PP

Page 54: Fault Tree Analysis

Steady-State Availability

1

0

2

02

11L

k

Lk

j

j

L

jj

P

PA


Recommended