2003
DOI: 10.1016/s0951-8320(03)00126-1
|View full text |Cite
|
Sign up to set email alerts
|

Exact reliability formula and bounds for general k-out-of-n systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2009
2009
2021
2021

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 17 publications
(4 citation statements)
references
References 2 publications
0
4
0
Order By: Relevance
“…In accordance with Example 1, we consider further an s-out-of-r system with statistically independent and identically distributed response components. In accordance with the work of (Kouckỳ, 2003), we denote by F D ptq " PpT l ď t @l P Dq " ś lPD F T l ptq the probability of joint failure of the components d Ď t1, ..., ru. Consequently, the joint failure time distribution function for a s-out-of-r system is expressed as,…”
Section: Numerical Examplesmentioning
confidence: 99%
“…In accordance with Example 1, we consider further an s-out-of-r system with statistically independent and identically distributed response components. In accordance with the work of (Kouckỳ, 2003), we denote by F D ptq " PpT l ď t @l P Dq " ś lPD F T l ptq the probability of joint failure of the components d Ď t1, ..., ru. Consequently, the joint failure time distribution function for a s-out-of-r system is expressed as,…”
Section: Numerical Examplesmentioning
confidence: 99%
“…Consecutive F Exact expression for the failure probability [1] Consecutive G Matrix formulation and solution [2] Consecutive F/G Computational algorithm [3] F/G Consider the environmental effects [4] G Computational algorithm [5] F/G Develop a data completion procedure [6] F/G Achieve exact formula and bounds [7] G Computational algorithm [8] F/G Present exact and approximate approach [9] Consecutive F/G Present a heuristic algorithm for replacement policies [10] Consecutive F Present a formula for twodimensional lower bound [11] F Investigate that where to allocate the spares [12] ( )…”
Section: Binarymentioning
confidence: 99%
“…Note that computing the conditional probability that there are k alarms given that a container is a threat or non-threat is not trivial if there is dependence between the sensors, which is likely to hold in practice. Finding these conditional probabilities can be accomplished by computing the reliability of a k-out-of-n reliability system, in which the system yields an alarm response if at least k sensors yield an alarm (Koucky 2003). Define the following parameters.…”
Section: The Container Reliability Knapsack Problemmentioning
confidence: 99%
“…where U (r) = s∈S(r) U(s) (Koucky 2003). Then, the probability that there are exactly k alarms is given by P kA = R (k,n) − R (k+1,n) , k = 0, 1, .…”
Section: The Container Reliability Knapsack Problemmentioning
confidence: 99%