Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Model-checking continuous-time Markov chains
ACM Transactions on Computational Logic (TOCL)
Performance of Computer Communication Systems: A Model-Based Approach
Performance of Computer Communication Systems: A Model-Based Approach
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Reduction and Refinement Strategies for Probabilistic Analysis
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Reduction and Refinement Strategies for Probabilistic Analysis
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Automated Performance and Dependability Evaluation Using Model Checking
Performance Evaluation of Complex Systems: Techniques and Tools, Performance 2002, Tutorial Lectures
PRISM: Probabilistic Symbolic Model Checker
TOOLS '02 Proceedings of the 12th International Conference on Computer Performance Evaluation, Modelling Techniques and Tools
Model Checking Performability Properties
DSN '02 Proceedings of the 2002 International Conference on Dependable Systems and Networks
Probabilistic Verification of Discrete Event Systems Using Acceptance Sampling
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Model-Checking Algorithms for Continuous-Time Markov Chains
IEEE Transactions on Software Engineering
CLOSED-FORM STOCHASTIC BOUNDS ON THE STATIONARY DISTRIBUTION OF MARKOV CHAINS
Probability in the Engineering and Informational Sciences
Computing Closed-Form Stochastic Bounds on Transient Distributions of Markov Chains
SAINT-W '05 Proceedings of the 2005 Symposium on Applications and the Internet Workshops
Stochastic model checking with stochastic comparison
EPEW'05/WS-FM'05 Proceedings of the 2005 international conference on European Performance Engineering, and Web Services and Formal Methods, international conference on Formal Techniques for Computer Systems and Business Processes
| Hi-index | 0.00 |
Continuous Stochastic Logic (CSL) which lets to express real time probabilistic properties on Continuous Time Markov Chains (CTMC) has been augmented by reward structures to check also performability measures. Thus Continuous Stochastic Reward Logic (CSRL) defined on Markov Reward Models (MRM) provides a framework to verify performance-related and as well as dependability-related measures. Probabilistic model checking can be provided through bounding transient, steady-state distributions of the underlying Markov chain, since models are checked to see if the considered measures are guaranteed or not. We propose to extend the model checking algorithm that we have proposed for CSL to the CSRL operators. This method is based on the construction of bounding models having closed-form transient and steady-state distributions by means of Stochastic Comparison technique. In the case when the model can be checked by this method we gain significantly in time and memory complexity. However in case when we can not conclude if the considered formula is satisfied or not, we may apply classical model checking algorithms.