Bounding Availability of Repairable Systems
IEEE Transactions on Computers
State space exploration in Markov models
SIGMETRICS '92/PERFORMANCE '92 Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
A Unified Framework for Simulating Markovian Models of Highly Dependable Systems
IEEE Transactions on Computers
Computing bounds on steady state availability of repairable computer systems
Journal of the ACM (JACM)
Data Structures and Algorithms
Data Structures and Algorithms
| Hi-index | 0.00 |
Two new algorithms are proposed for the computation of bounds for the steady-state reward rate of irreducible finite Markov models with slow forward and fast backward transitions. The algorithms use detailed knowledge of the model in a subset of generated states G and partial information about the model in the non-generated portion U of the state space. U is assumed partitioned into subsets U_{k}, 1