The reliability of a large series system under Markov structure

From MaRDI portal
Publication:3981882

DOI10.2307/1427682zbMath0795.60082OpenAlexW4249050374MaRDI QIDQ3981882

No author found.

Publication date: 26 June 1992

Published in: Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/1427682



Related Items

On the average run lengths of quality control schemes using a Markov chain approach, ON THE IFR PROPERTY PRESERVATION FOR MARKOV CHAIN IMBEDDABLE SYSTEMS, Reliability lower bounds for two-dimensional consecutive-\(k\)-out-of-\(n\): F systems, A geometric process repair model for a series repairable system with \(k\)-dissimilar components, MARKOV CHAIN METHOD FOR COMPUTING THE RELIABILITY OF HAMMOCK NETWORKS, An integrated quality and maintenance model for two-unit series systems, Stability analysis of a new kind \(n\)-unit series repairable system, Direct method for reliability computation of \(k\)-out-of-\(n\): G systems., Exact and asymptotic results for pattern waiting times, On reliabilities of certain large linearly connected engineering systems, The exact distribution of overlapping counting patterns associated with a sequence of homogeneous Markov-dependent multi-state trials: An application to secon, Geometric distribution of order \(k\) with a reward, On the dual reliability systems of \((n,f,k)\) and \(\langle n,f,k \rangle\), On exact and large deviation approximation for the distribution of the longest run in a sequence of two-state Markov dependent trials, Reliability evaluation of generalised multi-statek-out-of-nsystems based on FMCI approach, On ordered series and later waiting time distributions in a sequence of Markov dependent multistate trials, Reliabilities for \((n,f,k)\) systems, Reliabilities for (n, f, k (i, j)) and ⟨n, f, k (i, j)⟩ Systems, A Sensitivity Analysis for System Reliability, Asymptotic reliability of a linearly connected system with an infinite number of components, A martingale approach to scan statistics, An algorithm to compute the probability of a run in binary fourth-order Markovian trials.