Markov chain with taboo states and reliability

G. L. Sriwastav and S. N. N. Pandit

Naval Research Logistics Quarterly, 1978, vol. 25, issue 4, 653-658

Abstract: A computationally feasible matrix method is presented to find the first‐passage probabilities in a Markov chain where a set of states is taboo during transit. This concept has been used to evaluate the reliability of a system whose changes in strength can be thought of as a Markov chain, while the environment in which it is functioning generates stresses which can also be envisaged as another Markov chain.

Date: 1978
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800250407

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:wly:navlog:v:25:y:1978:i:4:p:653-658

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().