2012
DOI: 10.1080/03610926.2012.697969
|View full text |Cite
|
Sign up to set email alerts
|

Numerical Method for Reliability Analysis of Phased-Mission System Using Markov Chains

Abstract: This article presents a numerical method for solving continuous time Markov chain (CTMC) model for reliability evaluation of phased-mission system. The method generates infinitesimal matrix based on the statistical independence of subsystem failure and repair process. The infinitesimal generator matrix is stored by the use of sparse matrix-compressed storage schemes, and the transient solution of the CTMC model is obtained by using three methods including the uniformization method, forward Euler method, and Ru… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
21
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
8
1

Relationship

3
6

Authors

Journals

citations
Cited by 36 publications
(21 citation statements)
references
References 23 publications
0
21
0
Order By: Relevance
“…First, an effective algorithm is required to compute state probability vector of each phase Markov model; then, a states mapping mechanism is needed to obtain initial states probability vector of each phase (except the first one). The uniformization method 19 is used to solve the state probability vector and the states mapping rules are adapted from 20 to handle the mapping problems between consecutive phase state spaces.…”
Section: Case Studymentioning
confidence: 99%
“…First, an effective algorithm is required to compute state probability vector of each phase Markov model; then, a states mapping mechanism is needed to obtain initial states probability vector of each phase (except the first one). The uniformization method 19 is used to solve the state probability vector and the states mapping rules are adapted from 20 to handle the mapping problems between consecutive phase state spaces.…”
Section: Case Studymentioning
confidence: 99%
“…One common strategy [23][24][25][26][27] is to apply truncation to BDD (or fault tree) to slow down the exponential growth of time cost or space cost. Another strategy [28,29] focuses on the shrinkage of the Markovian methods through the compression storage of large sparse matrices. However, Contents lists available at ScienceDirect journal homepage: www.elsevier.com/locate/ress some experimental works [30][31][32][33] show that the fixed truncation limit may result in the significant error in results.…”
Section: Introductionmentioning
confidence: 99%
“…Combinational method is one of the most effective analytical methods in analyzing non-repairable PMS which are mainly based on binary decision diagrams (BDD) algorithm, but has to combine with state-based approaches to deal with repairable PMS [7,13]. State-based approaches could consider each possible state of the repairable systems [9]. However, they may suffer state space explosion problems when there are large number of components.…”
Section: Introductionmentioning
confidence: 99%