Bounding availability of repairable systems

DOI10.1109/12.40849MaRDI QIDQ5375503zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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
• scientific article; zbMATH DE number 1208668 (Why is no real title available?)
• scientific article; zbMATH DE number 6612394 (Why is no real title available?)
• 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)