Calculating Cumulative Operational Time Distributions of Repairable Computer Systems
IEEE Transactions on Computers - The MIT Press scientific computation series
Survey of software tools for evaluating reliability, availability, and serviceability
ACM Computing Surveys (CSUR)
Journal of the ACM (JACM)
Bounding Availability of Repairable Systems
IEEE Transactions on Computers
Probability and Statistics with Reliability, Queuing and Computer Science Applications
Probability and Statistics with Reliability, Queuing and Computer Science Applications
Dynamic State Exploration in Quantitative Protocol Analysis
Proceedings of the IFIP WG6.1 Ninth International Symposium on Protocol Specification, Testing and Verification IX
Probabilistic Verification of Communication Protocols
Proceedings of the IFIP WG6.1 Seventh International Conference on Protocol Specification, Testing and Verification VII
Efficient exploration of availability models guided by failure distances
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Bound Computation of Dependability and Performance Measures
IEEE Transactions on Computers
Transient Analysis of Superposed GSPNs
IEEE Transactions on Software Engineering
An Eclectic Survey of Bounding Methods for Markov Chain Models
MASCOTS '95 Proceedings of the 3rd International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
A new methodology for calculating distributions of reward accumulated during a finite interval
FTCS '96 Proceedings of the The Twenty-Sixth Annual International Symposium on Fault-Tolerant Computing (FTCS '96)
Performance estimation in a simultaneous multithreading processor
MASCOTS '96 Proceedings of the 4th International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
MASCOTS '96 Proceedings of the 4th International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
Using the probabilistic evaluation tool for the analytical solution of large Markov models
PNPM '95 Proceedings of the Sixth International Workshop on Petri Nets and Performance Models
Solving large interval availability models using a model transformation approach
Computers and Operations Research
Adaptive decomposition and approximation for the analysis of stochastic petri nets
Performance Evaluation - Dependable systems and networks-performance and dependability symposium (DSN-PDS) 2002: Selected papers
Stochastic Bounds for Partially Generated Markov Chains: An Algebraic Approach
EPEW '08 Proceedings of the 5th European Performance Engineering Workshop on Computer Performance Engineering
Using hidden non-Markovian Models to reconstruct system behavior in partially-observable systems
Proceedings of the 3rd International ICST Conference on Simulation Tools and Techniques
INFORMS Journal on Computing
Efficient calculation of rare event probabilities in Markovian queueing networks
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
Overview on Bayesian networks applications for dependability, risk analysis and maintenance areas
Engineering Applications of Artificial Intelligence
INFORMS Journal on Computing
Proceedings of the 2012 Extreme Modeling Workshop
| Hi-index | 0.00 |
Performance and dependability analysis is usually based on Markov models. One of the main problems faced by the analyst is the large state space cardinality of the Markov chain associated with the model, which precludes not only the model solution, but also the generation of the transition rate matrix. However, in many real system models, most of the probability mass is concentrated in a small number of states in comparison with the whole state space. Therefore, performability measures may be accurately evaluated from these “high probable” states. In this paper, we present an algorithm to generate the most probable states that is more efficient than previous algorithms in the literature. We also address the problem of calculating measures of interest and show how bounds on some measures can be efficiently calculated.