MARKOV CHAIN METHOD FOR COMPUTING THE RELIABILITY OF HAMMOCK NETWORKS
DOI10.1017/S0269964820000534zbMath1504.60173OpenAlexW3107655780MaRDI QIDQ5051171
Mihail Jianu, Marilena Jianu, Daniel Ciuiu, Leonard Dăuş
Publication date: 22 November 2022
Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0269964820000534
Graph polynomials (05C31) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Reliability, availability, maintenance, inspection in operations research (90B25) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Applications of renewal theory (reliability, demand theory, etc.) (60K10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A limit theorem of certain repairable systems
- Determining whether a class of random graphs is consistent with an observed contact network
- Reliability of Consecutive-k-out-of-n:F Systems with (k-1)-step Markov Dependence
- On Reliability of a Large Consecutive-k-out-of-n:F System with (k - 1)-step Markov Dependence
- The Complexity of Enumeration and Reliability Problems
- The reliability of a large series system under Markov structure
- On a Markov chain approach for the study of reliability structures
- Full Hermite interpolation of the reliability of a hammock network
