Bounding availability of repairable systems
From MaRDI portal
Publication:5375503
DOI10.1109/12.40849zbMATH Open1395.68057OpenAlexW1983712057MaRDI QIDQ5375503FDOQ5375503
Authors: Richard R. Muntz, Edmundo De Souza E. Silva, Ambuj Goyal 
Publication date: 14 September 2018
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/12.40849
Reliability, testing and fault tolerance of networks and computer systems (68M15) Network design and communication in computer systems (68M10)
Cited In (7)
- Specification techniques for Markov reward models
- Title not available (Why is that?)
- Title not available (Why is that?)
- Stationary distributions of continuous-time Markov chains: a review of theory and truncation-based approximations
- Sub-stochastic matrix analysis for bounds computation -- theoretical results
- Guaranteed approximation of Markov chains with applications to multiplexer engineering in ATM networks
- Computing bounds on steady state availability of repairable computer systems
This page was built for publication: Bounding availability of repairable systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5375503)
