Documente Academic
Documente Profesional
Documente Cultură
APLICATIA 1 - SOLUTIE
a)
PS = P ( X ) = P ( xi ) P ( ( xi = 1, X ) ) + P ( xi ) P ( ( xi = 0, X ) )
= P ( x1 ) P ( ( x1 = 1, X ) ) + P ( x1 ) P ( ( x1 = 0, X ) )
= P ( x1 ) P ((1, x2 , x3 ) ) + P ( x1 ) P ((0, x2 , x3 ) )
P ( ( x1 = 1, X ) ) = p3 + q3 p2
P ( ( x1 = 0, X ) ) = 0
( x1 = 1, X ) = x3 +& x3 x2 = x3 +& x2
P ( ( x1 = 0, X ) ) = 0
( X ) = x1 ( x3 +& x2 ) = x1 x3 +& x1 x2
APLICATIA 1 - SOLUTIE
b)
PS = P ( X ) = P ( xi ) P ( ( xi = 1, X ) ) + P ( xi ) P ( ( xi = 0, X ) )
= P ( x1 ) P ( ( x1 = 1, X ) ) + P ( x1 ) P ( ( x1 = 0, X ) )
= P ( x1 ) P ((1, x2 , x3 ) ) + P ( x1 ) P ((0, x2 , x3 ) )
= p1 ( p3 + q3 p2 ) + q1 0
= p1 p3 + p1 p2 p1 p2 p3
APLICATIA 1 - SOLUTIE
c)
n (i )
F .I .S . Birnbaum I B (i ) = N 1
2
FIS
1 P
F .I .S . Barlow Pr oschan I BP
(i) = S
0 p
( xi = 1, X ) = 1
( xi = 0, X ) = 0
Nicolici Stefan - Seminar 5 Fiabilitate
dp
pj=p
APLICATIA 1 - SOLUTIE
c)
( X ) = x1 ( x3 +& x2 ) = x1 x3 +& x1 x2
n (1) = 3
x1
1
1
1
1
0
0
0
0
x2
1
1
0
0
1
1
0
0
x3 Sistem: (X)
1
1
0
1
1
1
0
0
1
0
0
0
1
0
0
0
APLICATIA 1 - SOLUTIE
c)
( X ) = x1 ( x3 +& x2 ) = x1 x3 +& x1 x2
n (1) = 1
x1
1
1
1
1
0
0
0
0
x2
1
1
0
0
1
1
0
0
x3 Sistem: (X)
1
1
0
1
1
1
0
0
1
0
0
0
1
0
0
0
APLICATIA 1 - SOLUTIE
c)
( X ) = x1 ( x3 +& x2 ) = x1 x3 +& x1 x2
n (1) = 1
x1
1
1
1
1
0
0
0
0
x2
1
1
0
0
1
1
0
0
x3 Sistem: (X)
1
1
0
1
1
1
0
0
1
0
0
0
1
0
0
0
APLICATIA 1 - SOLUTIE
c)
(
)
n
i
1
I B (i ) = N 1 = (2) I B (2) = 31 = 1 / 4
2
2
APLICATIA 1 - SOLUTIE
c)
PS
0 p
i
1
F .I .S . Barlow Pr oschan I BP (i ) =
dp
pj =p
PS = p1 p3 + p1 p2 p1 p2 p3
PS
p1
PS
p1
PS
p1
=
p2 , 3 = p
=
p2 , 3 = p
=
p2 , 3 = p
PS
p1
PS
p2
PS
p3
=
p2 , 3 = p
=
p1, 3 = p
=
p1, 2 = p
( p1 p3 + p1 p2 p1 p2 p3 )
p1
( p1 p3 + p1 p2 p1 p2 p3 )
p2
( p1 p3 + p1 p2 p1 p2 p3 )
p3
= ( p3 + p2 p2 p3 ) p
p2 , 3 = p
= ( p1 p1 p3 ) p
1, 3 = p
p1, 3 = p
= ( p1 p1 p2 ) p
p1, 2 = p
1, 2 = p
2,3 = p
= p + p pp
= p pp
= p pp
APLICATIA 1 - SOLUTIE
c)
PS
0 p
i
1
F .I .S . Barlow Pr oschan I BP (i ) =
dp
pj =p
1
3
p
(1) (2 p p 2 )dp = p 2 = 1 1 / 3 = 2 / 3
0
3 0
1
2
3
1 P
1
p
p
I BP
(i ) = S
dp = (2) ( p p 2 )dp =
= 1 / 2 1 / 3 = 1 / 6
0 p
0
3 0
2
i pj =p
1
2
3
1
p
p
= 1 / 2 1 / 3 = 1 / 6
(
3
)
(
p
p
)
dp
=
2
0
3 0
2 1 1
1 I BP (i) = 3 + 6 + 6 = 1
APLICATIA 1 - SOLUTIE
d)
= i I B (i )
1
1 = 1 p1 = 0.0001 0.99
2 = 2 p2 = 0.002 0.9
3 = 3 p3 = 0.005 0.95
PS PS ( p1 p2 + p1 p3 p1 p2 p3 )
I
(
1
)
=
=
=
= p2 + p3 p2 p3 = 0.9 + 0.95 0.9 0.95
B
p
1
1
1
PS PS ( p1 p2 + p1 p3 p1 p2 p3 )
=
=
= p1 p1 p3 = 0.99 0.99 0.95
I B (2) =
p
2
2
2
PS PS ( p1 p2 + p1 p3 p1 p2 p3 )
=
=
= p1 p1 p2 = 0.99 0.99 0.9
I B (3) =
p
3
3
3
APLICATIA 1 - SOLUTIE
e) +f)
MUT =
PS
MDT =
QS
1 PS
APLICATIA 2:
Fie un sistem cu 7 componente binare, identice si independente. Probabilitatea
de succes a componentelor este p, iar intensitatea de defectare este . Daca
componenta 7 a sistemului este in stare de insucces atunci sistemul are
urmatoarele trasee minimale T1{4}, T2{1,2,6} si T3{1,3,5,6}; iar daca componenta
7 este in stare de succes atunci taieturile minimale ale sistemului sunt: K1{!2, !5,
!4} si K2{!2,!3, !4}.
Sa se determine:
a)
b)
c)
d)
APLICATIA 2 - SOLUTIE
Componenta
care se verifica
Componenta
INSUCCES
T1{4}
Componenta
SUCCES
T2{1,2,6}
T3{1,3,5,6}
APLICATIA 2 - SOLUTIE
Componenta
INSUCCES
T1{4}
T2 {1,
Componenta
care se verifica
Componenta
SUCCES
2, 6}
T3 {1, 3, 5, 6}
APLICATIA 2 - SOLUTIE
Componenta
INSUCCES
T1{4}
T2 {1,
Componenta
care se verifica
Componenta
SUCCES
2, 6}
T3 {1, 3, 5, 6}
APLICATIA 2 - SOLUTIE
Componenta
INSUCCES
T1{4}
T2 {1,
Componenta
care se verifica
Componenta
SUCCES
2, 6}
T3 {1, 3, 5, 6}
APLICATIA 2 - SOLUTIE
Componenta
care se verifica
Componenta
INSUCCES
T1{4}
Componenta
SUCCES
T2 {1,
2, 6}
T3 {1, 3, 5, 6}
APLICATIA 2 - SOLUTIE
Componenta
care se verifica
Componenta
INSUCCES
T1{4}
Componenta
SUCCES
T2 {1,
2, 6}
T3 {1, 3, 5, 6}
APLICATIA 2 - SOLUTIE
Componenta
care se verifica
Componenta
INSUCCES
T1{4}
Componenta
SUCCES
T2 {1,
2, 6}
T3 {1, 3, 5, 6}
Componenta
care se verifica
APLICATIA 2 - SOLUTIE
Componenta
SUCCES
T1{4}
T2 {1,
Componenta
INSUCCES
2, 6}
T3 {1, 3, 5, 6}
Componenta
care se verifica
APLICATIA 2 - SOLUTIE
Componenta
SUCCES
T1{4}
T2 {1,
Componenta
INSUCCES
2, 6}
T3 {1, 3, 5, 6}
Componenta
care se verifica
APLICATIA 2 - SOLUTIE
Componenta
SUCCES
T1{4}
T2 {1,
Componenta
INSUCCES
2, 6}
T3 {1, 3, 5, 6}
Componenta
care se verifica
APLICATIA 2 - SOLUTIE
Componenta
SUCCES
T1{4}
T2 {1,
Componenta
INSUCCES
2, 6}
T3 {1, 3, 5, 6}
Componenta
care se verifica
APLICATIA 2 - SOLUTIE
Componenta
SUCCES
T1{4}
T2 {1,
Componenta
INSUCCES
2, 6}
T3 {1, 3, 5, 6}
Componenta
care se verifica
APLICATIA 2 - SOLUTIE
a) DEZVOLTARE BDD
K1
{!2,
!5,
!4}
K2 {!2,
!3,
!4}.
RAMURA x7=1
Componenta
INSUCCES
Componenta
SUCCES
Componenta
care se verifica
APLICATIA 2 - SOLUTIE
a) DEZVOLTARE BDD
K1
{!2,
K2 {!2,
!5,
!3,
!4}
RAMURA x7=1
Componenta
INSUCCES
Componenta
SUCCES
!4}.
Componenta
care se verifica
APLICATIA 2 - SOLUTIE
a) DEZVOLTARE BDD
K1
{!2,
K2 {!2,
!5,
!3,
!4}
RAMURA x7=1
Componenta
INSUCCES
Componenta
SUCCES
!4}.
Componenta
care se verifica
APLICATIA 2 - SOLUTIE
a) DEZVOLTARE BDD
K1
{!2,
K2 {!2,
!5,
!3,
!4}
RAMURA x7=1
Componenta
INSUCCES
Componenta
SUCCES
!4}.
Componenta
care se verifica
APLICATIA 2 - SOLUTIE
a) DEZVOLTARE BDD
K1
{!2,
K2 {!2,
!5,
!3,
!4}
RAMURA x7=1
Componenta
INSUCCES
Componenta
SUCCES
!4}.
Componenta
care se verifica
APLICATIA 2 - SOLUTIE
a) DEZVOLTARE BDD
K1
{!2,
K2 {!2,
!5,
!3,
!4}
RAMURA x7=1
Componenta
INSUCCES
Componenta
SUCCES
!4}.
Componenta
care se verifica
APLICATIA 2 - SOLUTIE
a) DEZVOLTARE BDD
K1
{!2,
K2 {!2,
!5,
!3,
!4}
RAMURA x7=1
Componenta
INSUCCES
Componenta
SUCCES
!4}.
Componenta
care se verifica
APLICATIA 2 - SOLUTIE
a) DEZVOLTARE BDD
K1
{!2,
K2 {!2,
!5,
!3,
!4}
RAMURA x7=1
Componenta
INSUCCES
Componenta
SUCCES
!4}.
Componenta
care se verifica
APLICATIA 2 - SOLUTIE
a) DEZVOLTARE BDD
K1
{!2,
K2 {!2,
!5,
!3,
!4}
RAMURA x7=1
Componenta
INSUCCES
Componenta
SUCCES
!4}.
APLICATIA 2 - SOLUTIE
APLICATIA 2 - SOLUTIE
APLICATIA 2 - SOLUTIE
APLICATIA 2 - SOLUTIE
APLICATIA 2 - SOLUTIE
T1{4}
T1{7,4}
T2{6,1,2}
T2{7,2}
T3{6,1,3,5}
T3{7, 5,3}
T1{4}
T2{6,1,2}
T3{6,1,3,5}
T4{7,2}
T5{7, 5,3}
K1{!7,!4,!6}
K1{4,!2,!5}
K2{!7,!4,!1}
K2{4,!2,,!3}
K1{!7,!4,!6}
K2{!7,!4,!1}
K3{4,!2,!5}
K4{4,!2,,!3}
K3{!7,!4,!2,!3}
K4{!7,!4,!2,!5)
Nicolici Stefan - Seminar 5 Fiabilitate
APLICATIA 2 - SOLUTIE
x7=1
T1{4}
T2{1,2,6}
T3{1,3,5,6}
K1 {!2,!5, !4}
K2 {!2, !3,!4}
( X ) = xi ( xi = 1, X ) +& xi ( xi = 0, X )
( xi = 1, X ) = ( x1 , x2 ,.....xi 1 , xi = 1, xi +1.......)
( xi = 0, X ) = ( x1 , x2 ,.....xi 1 , xi = 0, xi +1.......)
APLICATIA 2 - SOLUTIE
( X ) = x7 ( x7 = 1, X ) +& x7 ( x7 = 0, X )
( x7 = 1, X ) = K1 +& K 2 = x2 x5 x4 +& x2 x3 x4
( x7 = 1, X ) = ( x7 = 1, X ) = K1 +& K 2 = x2 x5 x4 +& x2 x3 x4
= ( x2 +& x5 +& x4 )( x2 +& x3 +& x4 ) = x2 +& x4 +& x3 x5
x1 +& x1 x 2 = x1 (1 + x 2 ) = x1
Exemplu :x1 ( x1 +& x 2 + x 3 ) = x1 x1 +& x1 x 2 +& x1 x 3
= x1 +& x1 x 2 +& x1 x 3 = x1
Nicolici Stefan - Seminar 5 Fiabilitate
APLICATIA 2 - SOLUTIE
( X ) = x7 ( x7 = 1, X ) +& x7 ( x7 = 0, X )
= x7 ( x2 +& x4 +& x3 x5 ) +& x7 ( x4 +& x1 x2 x6 +& x1 x3 x5 x6 )
= x7 x2 +& x7 x4 +& x7 x3 x5 +& x7 x4 +& x7 x1 x2 x6 +& x7 x1 x3 x5 x6
= ( x7 x4 +& x7 x4 ) +& x7 x2 +& x7 x3 x5 +& x7 x1 x2 x6 +& x7 x1 x3 x5 x6
= x4 +& x7 x2 (1 +& x1 x6 ) +& x7 x3 x5 (1 +& x1 x6 ) +& x7 x1 x2 +& x7 x1 x3 x5 x6
= x4 +& x7 x2 +& ( x7 x2 x1 x6 +& x7 x1 x2 x6 ) +& x7 x3 x5 +& ( x7 x3 x5 x1 x6 +& x7 x1 x3 x5 x6 )
= x4 +& x7 x2 +& x2 x1 x6 +& x7 x3 x5 +& x3 x5 x1 x6
APLICATIA 2 - SOLUTIE
APLICATIA 2 - SOLUTIE
APLICATIA 2 - SOLUTIE
APLICATIA 2 - SOLUTIE
n (i )
F .I .S . Birnbaum I B (i ) = N 1
2
FIS
1 P
F .I .S . Barlow Pr oschan I BP
(i) = S
0 p
( xi = 1, X ) = 1
( xi = 0, X ) = 0
Nicolici Stefan - Seminar 5 Fiabilitate
dp
pj=p
APLICATIA 2 - SOLUTIE
x 1 x 2 x 3 x 4 x 5 x6 x7
1 1
0
1 0
APLICATIA 2 - SOLUTIE
x 1 x 2 x 3 x 4 x 5 x6 x7
1
Nr de vectori critici
pentru x7=0
(1 casuta libera)
21
(0 casute libere)
20
APLICATIA 2 - SOLUTIE
x 1 x 2 x 3 x 4 x 5 x6 x7
1
0
1
APLICATIA 2 - SOLUTIE
x 1 x 2 x 3 x 4 x 5 x6 x7
1
1
Nr de vectori critici
pentru x7=1
(3 casute libere)
23
(2 casute libere)
22
n (2) = 20 + 21 + 2 2 + 23 = 1 + 2 + 4 + 8 = 15
I B (2) =
n (2)
271
15
64
APLICATIA 2 - SOLUTIE
( x2 = 1, X ) = 1
( x2 = 0, X ) = 0
Adica sistemul este in SUCCES prin traseele care il contin pe 2, iar restul de trasee sunt
indisponibile
Traseu
x1 x2 x3 x4 x5 x6 x7
Lista trasee SISTEM x7=0:
T2=1
1 1
1 0
T1=0
0
T1{4}
T3=0
0
T2{1,2,6}
T3=0
1
0
T {1,3,5,6}
3
1
1
1
1
0
1
0
0
1
1
0
0
2 vectori critici
1 vector critic
APLICATIA 2 - SOLUTIE
x1 x2 x3 x4 x5 x6 x7
1
0
0
1
1
1
0
1
0
0
0
1
1
n (2) = 20 + 21 + 2 2 + 23 = 1 + 2 + 4 + 8 = 15
I B (2) =
n (2)
271
15
=
64
Traseu
T2=1
T1=0
T3=0
T3=0
8 vectori critici
4 vectori critici
APLICATIA 2 - SOLUTIE
d) MUT Sistem
MUT =
PS
= p + p(1 p)(1 + p p 2 ) 2
= p + p(1 + p p 2 p p 2 + p 3 )(1 + p p 2 )
= p + p(1 2 p 2 + p 3 )(1 + p p 2 )
= p + p(1 + p p 2 2 p 2 2 p 3 + 2 p 4 + p 3 + p 4 p 5 )
= p + p(1 + p 3 p 2 p 3 + 3 p 4 p 5 )
= 2 p + p2 3 p3 p 4 + 3 p5 p6
= 2 p + p 2 2 3 p 3 3 p 4 4 + 3 p 5 5 p 6 6
Nicolici Stefan - Seminar 5 Fiabilitate