Patterns in property specifications for finite-state verification
Proceedings of the 21st international conference on Software engineering
Model-checking continuous-time Markov chains
ACM Transactions on Computational Logic (TOCL)
Performance of Communication Systems: A Model-Based Evaluation with Matrix-Geometric Methods
Performance of Communication Systems: A Model-Based Evaluation with Matrix-Geometric Methods
Performance of Computer Communication Systems: A Model-Based Approach
Performance of Computer Communication Systems: A Model-Based Approach
On the Logical Characterisation of Performability Properties
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
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
Probabilistic symbolic model checking with PRISM: a hybrid approach
International Journal on Software Tools for Technology Transfer (STTT) - Special section on tools and algorithms for the construction and analysis of systems
Model checking meets performance evaluation
ACM SIGMETRICS Performance Evaluation Review
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Uniformization with representatives: comprehensive transient analysis of infinite-state QBDs
SMCtools '06 Proceeding from the 2006 workshop on Tools for solving structured Markov chains
CSL model checking algorithms for QBDs
Theoretical Computer Science
Model Checking of Infinite State Space Markov Chains by Stochastic Bounds
ASMTA '08 Proceedings of the 15th international conference on Analytical and Stochastic Modeling Techniques and Applications
An analytical model for end-to-end communication channel over PLCN based on QBDs
Information Processing Letters
Three-valued abstraction for continuous-time Markov chains
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Performability assessment by model checking of Markov reward models
Formal Methods in System Design
CSL model checking algorithms for infinite-state structured Markov chains
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Performance analysis for (X,S)-bottleneck cell in large-scale wireless networks
Information Processing Letters
| Hi-index | 0.00 |
In this paper algorithms for model checking CSL (continuous stochastic logic) against infinite-state continuous-time Markov chains of so-called quasi birth-death type are developed. In doing so we extend the applicability of CSL model checking beyond the recently proposed case for finite-state continuous-time Markov chains, to an important class of infinite-state Markov chains. We present syntax and semantics for CSL and develop efficient model checking algorithms for the steady-state operator and the time-bounded next and until operator. For the former, we rely on the so-called matrix-geometric solution of the steady-state probabilities of the infinite-state Markov chain. For the time-bounded until operator we develop a new algorithm for the transient analysis of infinite-state Markov chains, thereby exploiting the quasi birth-death structure. A case study shows the feasibility of our approach.