A Lower Bound for System Availability Computation

DOI10.1109/TR.1986.4335570MaRDI QIDQ4721355zbMATH OpenOpenAlexFDO

Authors Radu A. Florescu

Publication date 1986

Published in IEEE Transactions on Reliability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tr.1986.4335570

zbMATH Keywords

Boole inequalityMarkov modelsystem availability

Mathematics Subject Classification ID

Applications of renewal theory (reliability, demand theory, etc.) (60K10) Reliability, availability, maintenance, inspection in operations research (90B25)

Recommendations

• scientific article; zbMATH DE number 19248
• Approximate Fault-Tree Analysis with Prescribed Accuracy
• Computing bounds on steady state availability of repairable computer systems
• An efficient and numerically stable method for computing bounds for the interval availability distribution
• Bounds for the availabilities in a fixed time interval for multistate monotone systems

Cited in

(5)

• Properties and computation of interval availability of system
• Computing bounds on steady state availability of repairable computer systems
• Some comparison results of system availability
• scientific article; zbMATH DE number 770198 (Why is no real title available?)
• ON MEASURE OF SYSTEM INTERVAL AVAILABILITY

This page was built for publication: A Lower Bound for System Availability Computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4721355)