Computing Poisson probabilities
Communications of the ACM
A Measure of Guaranteed Availability and its Numerical Evaluation
IEEE Transactions on Computers
Performability Analysis: Measures, an Algorithm, and a Case Study
IEEE Transactions on Computers - Fault-Tolerant Computing
Queueing networks—exact computational algorithms: a unified theory based on decomposition and aggregation
Distribution of the minimal completion time of parallel tasks in multi-reward semi-Markov models
Performance Evaluation - Special issue on performability modelling of computer and communication systems
A compositional approach to performance modelling
A compositional approach to performance modelling
State-space support for path-based reward variables
IPDS '98 Proceedings of the third IEEE international performance and dependability symposium on International performance and dependability symposium
Model checking
Model-checking continuous-time Markov chains
ACM Transactions on Computational Logic (TOCL)
Process algebra for performance evaluation
Theoretical Computer Science
Performance Analysis of Communication Systems with Non-Markovian Stochastic Petri Nets
Performance Analysis of Communication Systems with Non-Markovian Stochastic Petri Nets
Model Checking Continuous-Time Markov Chains by Transient Analysis
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Verifying Continuous Time Markov Chains
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Model Checking Performability Properties
DSN '02 Proceedings of the 2002 International Conference on Dependable Systems and Networks
Calculating the Distribution of a Linear Combination of Uniform Order Statistics
INFORMS Journal on Computing
On the Use of Model Checking Techniques for Dependability Evaluation
SRDS '00 Proceedings of the 19th IEEE Symposium on Reliable Distributed Systems
Model-Checking Algorithms for Continuous-Time Markov Chains
IEEE Transactions on Software Engineering
Markov regenerative SPN with non-overlapping activity cycles
IPDS '95 Proceedings of the International Computer Performance and Dependability Symposium on Computer Performance and Dependability Symposium
Logic in Computer Science: Modelling and Reasoning about Systems
Logic in Computer Science: Modelling and Reasoning about Systems
A Structured Path-Based Approach for Computing Transient Rewards of Large CTMCs
QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
Model Checking Markov Reward Models with Impulse Rewards
DSN '05 Proceedings of the 2005 International Conference on Dependable Systems and Networks
Using probabilistic model checking for dynamic power management
Formal Aspects of Computing
QEST '05 Proceedings of the Second International Conference on the Quantitative Evaluation of Systems
Uniformization with representatives: comprehensive transient analysis of infinite-state QBDs
SMCtools '06 Proceeding from the 2006 workshop on Tools for solving structured Markov chains
Computing Battery Lifetime Distributions
DSN '07 Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Model Checking Markov Chains with Actions and State Labels
IEEE Transactions on Software Engineering
Performance-Related Reliability Measures for Computing Systems
IEEE Transactions on Computers
Closed-Form Solutions of Performability
IEEE Transactions on Computers
On Evaluating the Performability of Degradable Computing Systems
IEEE Transactions on Computers
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
Bisimulation minimisation mostly speeds up probabilistic model checking
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Modeling and analysis of power-aware systems
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
SFM'07 Proceedings of the 7th international conference on Formal methods for performance evaluation
On reduction criteria for probabilistic reward models
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Model checking infinite-state markov chains
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A fast algorithm for the transient reward distribution in continuous-time Markov chains
Operations Research Letters
Performability measure specification: combining CSRL and MSL
FMICS'11 Proceedings of the 16th international conference on Formal methods for industrial critical systems
Rewarding probabilistic hybrid automata
Proceedings of the 16th international conference on Hybrid systems: computation and control
More or less true: DCTL for continuous-time MDPs
FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems
Hi-index | 0.00 |
This paper describes efficient procedures for model checking Markov reward models, that allow us to evaluate, among others, the performability of computer-communication systems. We present the logic CSRL (Continuous Stochastic Reward Logic) to specify performability measures. It provides flexibility in measure specification and paves the way for the numerical evaluation of a wide variety of performability measures. The formal measure specification in CSRL also often helps in reducing the size of the Markov reward models that need to be numerically analysed. The paper presents background on Markov-reward models, as well as on the logic CSRL (syntax and semantics), before presenting an important duality result between reward and time. We discuss CSRL model-checking algorithms, and present five numerical algorithms and their computational complexity for verifying time- and reward-bounded until-properties, one of the key operators in CSRL. The versatility of our approach is illustrated through a performability case study.