A Uniformization-Based Algorithm for Model Checking the CSL Until Operator on Labeled Queueing Networks

Authors:
Anne Remke;Boudewijn R. Haverkort
Affiliations:
Design and Analysis of Communication Systems Faculty for Electrical Engineering, Mathematics and Computer Science, University of Twente,;Design and Analysis of Communication Systems Faculty for Electrical Engineering, Mathematics and Computer Science, University of Twente,
Venue:
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Year:
2008

Citing 5
Cited 0

Model-checking continuous-time Markov chains

ACM Transactions on Computational Logic (TOCL)
Model-Checking Algorithms for Continuous-Time Markov Chains

IEEE Transactions on Software Engineering
Model Checking Markov Reward Models with Impulse Rewards

DSN '05 Proceedings of the 2005 International Conference on Dependable Systems and Networks
CSL model checking algorithms for QBDs

Theoretical Computer Science
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a model checking procedure for the CSL until operator on the CTMCs that underly Jackson queueing networks. The key issue lies in the fact that the underlying CTMC is infinite in as many dimensions as there are queues in the JQN. We need to compute the transient state probabilities for all goal states and for all possible starting states. However, for these transient probabilities no computational procedures are readily available. The contribution of this paper is the proposal of a new uniformization-based approach to compute the transient state probabilities. Furthermore, we show how the highly structured state space of JQNs allows us to compute the possible infinite satisfaction set for until formulas. A case study on an e-business site shows the feasibility of our approach.