Numerical solution of reliability models described by stochastic automata networks

Mindaugas Å nipas, Virginijus Radziukynas and Eimutis ValakeviÄ ius

Reliability Engineering and System Safety, 2018, vol. 169, issue C, 570-578

Abstract: This paper presents the solution of Markov chain reliability models with a large state-space. To specify a system reliability model, we use our previously proposed methodology, which is based on the Stochastic Automata Networks formalism. We model parts of the system by arrowhead matrices with functional transition rates. As a result, the infinitesimal generator matrix of the reliability model has a distinctive structure. In this paper, we demonstrate that a block Gauss–Seidel method can be applied very efficiently to such a structure. The application of the proposed methodology is illustrated by an example of a standard 3/2 substation configuration. Even though its Markov chain reliability model has almost two million states, its steady-state probabilities can be estimated in just a few seconds of CPU time.

Keywords: Reliability modelling; Markov chains; Stochastic automata networks; Numerical methods; Steady-state probabilities (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0951832017301862
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:reensy:v:169:y:2018:i:c:p:570-578

DOI: 10.1016/j.ress.2017.09.024

Access Statistics for this article

Reliability Engineering and System Safety is currently edited by Carlos Guedes Soares

More articles in Reliability Engineering and System Safety from Elsevier
Bibliographic data for series maintained by Catherine Liu ().