A ! S

Quantification of sequences
Two kinds of algorithms
A : Exhaustive search (well suited to non repairable systems or for short mission times)
B : SRI algorithm (well suited to completely and quickly repairable systems )
1
λ
1 12
λ
2 23
3
µ 21
2
3 1
2
3 1
A : P(1,2,3;t) + P(1,2,1,2,3;t) < 1-R(t) < P(1,2,3;t) + P(1,2,1,2,3;t) +
P(1,2,1,2,1;t)
B : R(t) # exp (- Λε t) pessimistic approximation
Λ= output rate for the initial state (here: λ 12 ,)
ε = Pr(going from initial state to failure state without traversing
the initial state) (here: λ 23 /(λ 23 + µ 21 )
28