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

  • Anne Remke
  • Boudewijn R. Haverkort
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5215)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aziz, A., Sanwal, K., Brayton, R.: Model checking continuous-time Markov chains. ACM Transactions on Computational Logic 1(1), 162–170 (2000)CrossRefMathSciNetGoogle Scholar
  2. 2.
    Baier, C., Haverkort, B.R., Hermanns, H., Katoen, J.-P.: Model-checking algorithms for continuous-time Markov chains. IEEE Transactions on Software Engineering 29(7), 524–541 (2003)CrossRefGoogle Scholar
  3. 3.
    Bell, A.: Distributed evaluation of stochasic Petri nets. PhD thesis, Dept.of Computer Science, RWTH Aachen (2004)Google Scholar
  4. 4.
    Buchholz, P.: A class of hierarchical queueing systems and their analysis. Qeueing Systems 15, 59–80 (1994)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Ciardo, G.: Discrete-time Markovian stochastic Petri nets. In: Computations with Markov Chains, pp. 339–358. Raleigh (1995)Google Scholar
  6. 6.
    Cloth, L., Katoen, J.-P., Khattri, M., Pulungan, R.: Model checking Markov reward models with impulse rewards. In: Int. Conf. on Dependable Systems and Networks (DSN2005). IEEE Press, Los Alamitos (2005)Google Scholar
  7. 7.
    Gross, D., Miller, D.R.: The randomization technique as a modeling tool and solution procedure for transient Markov processes. Operations Research 32(2), 343–361 (1984)zbMATHMathSciNetCrossRefGoogle Scholar
  8. 8.
    Harrison, P.G.: Transient behaviour of queueing networks. Journal of Applied Probability 18(2), 482–490 (1981)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Jackson, J.R.: Networks of waiting lines. Operations Research 5(4), 518–521 (1957)MathSciNetGoogle Scholar
  10. 10.
    Menasce, D.A., Almeida, V.A.F., Dowdy, L.W.: Performance by Design. Prentice-Hall, Englewood Cliffs (2004)Google Scholar
  11. 11.
    Remke, A.: Model checking structured infinite Markov chains. PhD thesis, Dept.of Computer Science, University Twente (2008)Google Scholar
  12. 12.
    Remke, A., Haverkort, B.R.: CSL model checking algorithms for infinite-state structured Markov chains. In: Raskin, J.-F., Thiagarajan, P.S. (eds.) FORMATS 2007. LNCS, vol. 4763, pp. 336–351. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  13. 13.
    Remke, A., Haverkort, B.R., Cloth, L.: CSL model checking algorithms for QBDs. Theoretical Computer Science (2007)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Anne Remke
    • 1
  • Boudewijn R. Haverkort
    • 1
  1. 1.Design and Analysis of Communication Systems Faculty for Electrical Engineering, Mathematics and Computer ScienceUniversity of Twente 

Personalised recommendations