Advertisement

Weak Stochastic Comparisons for Performability Verification

  • Hind Castel-Taleb
  • Nihal Pekergin
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5513)

Abstract

The probabilistic model checking provides a precise formalism for the performance and reliability verification of telecommunication systems modeled by Markov chains. We study a queueing system similar to a Jackson network except that queues have a finite capacity. We propose to study in this paper (state and path) formulas from the Continuous Stochastic Logic (CSL), in order to verify performability properties. Unfortunately, transient and stationary analysis is very complex for multidimensional Markov processes. So we propose to use the stochastic comparisons in the sense of weak orderings to define bounding processes. Bounding processes are represented by independent M/M/1 queues for which transient and stationary distributions can be computed as the product of probability distributions of each queue. We use the increasing set method, and we develop an intuitive formalism based on events to establish weak stochastic comparisons.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aziz, A., Sanwal, K., Singhal, V., Brayton, R.: Model Checking Continuous Time Markov Chains. ACM Trans. on Comp. Logic 1(1), 162–170 (2000)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Baier, C., Haverkort, B., Hermanns, H., Katoen, J.P.: Model-Checking Algorithms for Continuous Markov Chains. IEEE Transactions on Software Engineering 29(6) (June 2003)Google Scholar
  3. 3.
    Ben Mamoun, M., Pekergin, N., Younès, S.: Model Checking of Continuous Time Markov Chains by Closed-Form Bounding Distributions. In: Qest 2006 (2006)Google Scholar
  4. 4.
    Castel-Taleb, H., Mokdad, L., Pekergin, N.: Model Checking of steady-state rewards using bounding aggregations. In: 2008 International Symposium on Performance Evaluation of Computer and Telecommunication Systems, SPECTS 2008, Edinburgh, UK, June 16-18 (2008)Google Scholar
  5. 5.
    Castel-Taleb, H., Pekergin, N.: Stochastic monotonicity in queueing networks (submitted)Google Scholar
  6. 6.
    Clarke, E.M., Emerson, A., Sistla, A.P.: Automatic verification of finite-state concurrent systems using temporal logic spacifications. ACM Trans. on Programming Languages and Systems 8(2), 244–263 (1986)CrossRefzbMATHGoogle Scholar
  7. 7.
    Fourneau, J.M., Pekergin, N.: An algorithmic approach to stochastic bounds. In: Calzarossa, M.C., Tucci, S. (eds.) Performance 2002. LNCS, vol. 2459, p. 64. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  8. 8.
    Lindvall, T.: Lectures on the coupling method. Wiley series in Probability and Mathematical statistics (1992)Google Scholar
  9. 9.
    Lindvall, T.: Stochastic monotonicities in Jackson queueing networks. Prob. in the Engineering and Informational Sciences 11, 1–9 (1997)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Massey, W.: Stochastic orderings for Markov processes on partially ordered spaces. Mathematics of Operations Research 12(2) (May 1987)Google Scholar
  11. 11.
    Massey, W.: A family of bounds for the transient behavior of a Jackson Network. J. App. Prob. 23, 543–549 (1986)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Pekergin, N., Younes, S.: Stochastic model checking with stochastic comparison. In: Bravetti, M., Kloul, L., Zavattaro, G. (eds.) EPEW/WS-EM 2005. LNCS, vol. 3670, pp. 109–124. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  13. 13.
    Remke, A., Haverkort, B.R.: CSL model checking algorithms for infinite-state structured Markov chainsGoogle Scholar
  14. 14.
    Stoyan, D.: Comparison methods for queues and other stochastics models. J. Wiley and son, Chichester (1976)Google Scholar
  15. 15.
    Younes, S.: Model Checking Stochastique par la méthode de comparaison stochastique, Thèse de doctorat de l’université de Versailles Saint Quentin (December 2008)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Hind Castel-Taleb
    • 1
  • Nihal Pekergin
    • 2
  1. 1.INSTITUT TELECOM, Telecom et Management SudParisEvry CedexFrance
  2. 2.LACL, Université Paris-Est Val de MarneCréteil CedexFrance

Personalised recommendations