2015
DOI: 10.1016/j.ress.2014.09.006
|View full text |Cite
|
Sign up to set email alerts
|

Efficient analysis of multi-state k-out-of-n systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

2
46
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 80 publications
(48 citation statements)
references
References 17 publications
2
46
0
Order By: Relevance
“…Both entities reduce the resulting expansion tree (which is exponential in size) to a rooted acyclic graph that is both canonical and hopefully compact or subexponential. The reduction rules [21] require (a) complete sum expressions are identical. These expressions are shellable and allow the introduction of PRE expressions of the same number of terms.…”
Section: The Sfgs Of S Ands Are Essentially Robddsmentioning
confidence: 99%
“…Both entities reduce the resulting expansion tree (which is exponential in size) to a rooted acyclic graph that is both canonical and hopefully compact or subexponential. The reduction rules [21] require (a) complete sum expressions are identical. These expressions are shellable and allow the introduction of PRE expressions of the same number of terms.…”
Section: The Sfgs Of S Ands Are Essentially Robddsmentioning
confidence: 99%
“…where the initial parameters are For C2, its differential equations are: dp t dt p t u p t dp t dt p For C3, we can also get its state differential equations dp t dt p t u p t dp t dt p t , (27) where the initial conditions are (25), (26) and (27).…”
Section: Illustrative Examplesmentioning
confidence: 99%
“…The widespread recognition of MSS is that it has been defined as having different performance levels and/or some failure modes with corresponding effects on the system's entire performance. Many researchers have made various contributions for the MSS reliability evaluation and modeling theory recently [13,23,8,9,27,40]. The commonly adopted methods have five basic approaches, such as, an extension of binary theory to MSS cases, the stochastic process approach, the universal generating function (UGF), the Monte-Carlo simulation and recursive algorithm etc [14,45,22,19,2,20,37].…”
Section: Introductionmentioning
confidence: 99%
“…The assumptions the assumptions of above approaches may not conform to most real-life systems. 11 Dynamic models: Markov model 12,13 ; dynamic fault tree [14][15][16] ; Petri net 17,18 ; Bayesian network 6,19,20 ; multivalued decision diagram 21,22 ; universal generating functions [23][24][25] ; and stochastic process approach 26,27 The problem of combinatorial explosion is intractable. Some of them have been criticized for the high computational complexity.…”
Section: Introduction and Literature Reviewmentioning
confidence: 99%