-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathfailureRate.Rd
135 lines (108 loc) · 5.6 KB
/
failureRate.Rd
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/allgenerics.R
\name{failureRate}
\alias{failureRate}
\title{Failure Rate Function}
\usage{
failureRate(
x,
k,
upstates = x$states,
failure.rate = c("BMP", "RG"),
level = 0.95,
epsilon = 0.001,
klim = 10000
)
}
\arguments{
\item{x}{An object of S3 class \code{smmfit} or \code{smm}.}
\item{k}{A positive integer giving the period \eqn{[0, k]} on which the
BMP-failure rate should be computed.}
\item{upstates}{Vector giving the subset of operational states \eqn{U}.}
\item{failure.rate}{Type of failure rate to compute. If \code{failure.rate = "BMP"}
(default value), then BMP-failure-rate is computed. If \code{failure.rate = "RG"},
the RG-failure rate is computed.}
\item{level}{Confidence level of the asymptotic confidence interval. Helpful
for an object \code{x} of class \code{smmfit}.}
\item{epsilon}{Value of the reliability above which the latter is supposed
to be 0 because of computation errors (see Details).}
\item{klim}{Optional. The time horizon used to approximate the series in the
computation of the mean sojourn times vector \eqn{m} (cf.
\link{meanSojournTimes} function) for the asymptotic variance.}
}
\value{
A matrix with \eqn{k + 1} rows, and with columns giving values of
the BMP-failure rate or RG-failure rate, variances, lower and upper
asymptotic confidence limits (if \code{x} is an object of class \code{smmfit}).
}
\description{
Function to compute the BMP-failure rate or the RG-failure rate.
Consider a system \eqn{S_{ystem}} starting to work at time
\eqn{k = 0}. The BMP-failure rate at time \eqn{k \in N} is the conditional
probability that the failure of the system occurs at time \eqn{k}, given
that the system has worked until time \eqn{k - 1}.
The RG-failure rate is a discrete-time adapted failure rate, proposed by
D. Roy and R. Gupta. Classification of discrete lives. Microelectronics
Reliability, 32(10):1459--1473, 1992. We call it the RG-failure rate and
denote it by \eqn{r(k),\ k \in N}.
}
\details{
Consider a system (or a component) \eqn{S_{ystem}} whose possible
states during its evolution in time are \eqn{E = \{1,\dots,s\}}.
Denote by \eqn{U = \{1,\dots,s_1\}} the subset of operational states of
the system (the up states) and by \eqn{D = \{s_1 + 1,\dots,s\}} the
subset of failure states (the down states), with \eqn{0 < s_1 < s}
(obviously, \eqn{E = U \cup D} and \eqn{U \cap D = \emptyset},
\eqn{U \neq \emptyset,\ D \neq \emptyset}). One can think of the states
of \eqn{U} as different operating modes or performance levels of the
system, whereas the states of \eqn{D} can be seen as failures of the
systems with different modes.
We are interested in investigating the failure rate of a discrete-time
semi-Markov system \eqn{S_{ystem}}. Consequently, we suppose that the
evolution in time of the system is governed by an E-state space
semi-Markov chain \eqn{(Z_k)_{k \in N}}. The system starts to work at
instant \eqn{0} and the state of the system is given at each instant
\eqn{k \in N} by \eqn{Z_k}: the event \eqn{\{Z_k = i\}}, for a certain
\eqn{i \in U}, means that the system \eqn{S_{ystem}} is in operating mode
\eqn{i} at time \eqn{k}, whereas \eqn{\{Z_k = j\}}, for a certain
\eqn{j \in D}, means that the system is not operational at time \eqn{k}
due to the mode of failure \eqn{j} or that the system is under the
repairing mode \eqn{j}.
The BMP-failure rate at time \eqn{k \in N} is the conditional probability
that the failure of the system occurs at time \eqn{k}, given that the
system has worked until time \eqn{k - 1}.
Let \eqn{T_D} denote the first passage time in subset \eqn{D}, called
the lifetime of the system, i.e.,
\deqn{T_D := \textrm{inf}\{ n \in N;\ Z_n \in D\}\ \textrm{and}\ \textrm{inf}\ \emptyset := \infty.}
For a discrete-time semi-Markov system, the failure rate at time
\eqn{k \geq 1} has the expression:
\deqn{\lambda(k) := P(T_{D} = k | T_{D} \geq k)}
We can rewrite it as follows :
\deqn{\lambda(k) = 1 - \frac{R(k)}{R(k - 1)},\ \textrm{if } R(k - 1) \neq 0;\ \lambda(k) = 0, \textrm{otherwise}}
The failure rate at time \eqn{k = 0} is defined by \eqn{\lambda(0) := 1 - R(0)},
with \eqn{R} being the reliability function (see \link{reliability} function).
The calculation of the reliability \eqn{R} involves the computation of
many convolutions. It implies that the computation error, may be higher
(in value) than the "true" reliability itself for reliability close to 0.
In order to avoid inconsistent values of the BMP-failure rate, we use the
following formula:
\deqn{\lambda(k) = 1 - \frac{R(k)}{R(k - 1)},\ \textrm{if } R(k - 1) \geq \epsilon;\ \lambda(k) = 0, \textrm{otherwise}}
with \eqn{\epsilon}, the threshold, the parameter \code{epsilon} in the
function \code{failureRate}.
Expressing the RG-failure rate \eqn{r(k)} in terms of the reliability
\eqn{R} we obtain that the RG-failure rate function for a discrete-time
system is given by:
\deqn{r(k) = - \ln \frac{R(k)}{R(k - 1)},\ \textrm{if } k \geq 1;\ r(k) = - \ln R(0),\ \textrm{if } k = 0}
for \eqn{R(k) \neq 0}. If \eqn{R(k) = 0}, we set \eqn{r(k) := 0}.
Note that the RG-failure rate is related to the BMP-failure rate by:
\deqn{r(k) = - \ln (1 - \lambda(k)),\ k \in N}
}
\references{
V. S. Barbu, N. Limnios. (2008). Semi-Markov Chains and Hidden Semi-Markov
Models Toward Applications - Their Use in Reliability and DNA Analysis.
New York: Lecture Notes in Statistics, vol. 191, Springer.
R.E. Barlow, A.W. Marshall, and F. Prochan. (1963). Properties of probability
distributions with monotone hazard rate. Ann. Math. Statist., 34, 375-389.
D. Roy and R. Gupta. (1992). Classification of discrete lives.
Microelectron. Reliabil., 32 (10), 1459-1473.
}