Bounding availability of repairable systems
- 1 January 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 38 (12), 1714-1723
- https://doi.org/10.1109/12.40849
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Numerical transient analysis of markov modelsComputers & Operations Research, 1988
- Probabilistic modeling of computer system availabilityAnnals of Operations Research, 1987
- Computable Bounds for Conditional Steady-State Probabilities in Large Markov Chains and Queueing ModelsIEEE Journal on Selected Areas in Communications, 1986
- Calculating Cumulative Operational Time Distributions of Repairable Computer SystemsIEEE Transactions on Computers, 1986
- On the stochastic structure of parallelism and synchronization models for distributed algorithmsPublished by Association for Computing Machinery (ACM) ,1985
- Bounds for the Positive Eigenvectors of Nonnegative Matrices and for their Approximations by DecompositionJournal of the ACM, 1984
- The Randomization Technique as a Modeling Tool and Solution Procedure for Transient Markov ProcessesOperations Research, 1984
- Monte Carlo simulation of Markov unreliability modelsNuclear Engineering and Design, 1984
- Ultrahigh Reliability Prediction for Fault-Tolerant Computer SystemsIEEE Transactions on Computers, 1983
- On Network Linguistics and the Conversational Design of Queueing NetworksJournal of the ACM, 1971