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.
Partially supported by french research project ANR-SETI06-02.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aziz, A., Sanwal, K., Singhal, V., Brayton, R.: Model Checking Continuous Time Markov Chains. ACM Trans. on Comp. Logic 1(1), 162–170 (2000)
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)
Ben Mamoun, M., Pekergin, N., Younès, S.: Model Checking of Continuous Time Markov Chains by Closed-Form Bounding Distributions. In: Qest 2006 (2006)
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)
Castel-Taleb, H., Pekergin, N.: Stochastic monotonicity in queueing networks (submitted)
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)
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)
Lindvall, T.: Lectures on the coupling method. Wiley series in Probability and Mathematical statistics (1992)
Lindvall, T.: Stochastic monotonicities in Jackson queueing networks. Prob. in the Engineering and Informational Sciences 11, 1–9 (1997)
Massey, W.: Stochastic orderings for Markov processes on partially ordered spaces. Mathematics of Operations Research 12(2) (May 1987)
Massey, W.: A family of bounds for the transient behavior of a Jackson Network. J. App. Prob. 23, 543–549 (1986)
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)
Remke, A., Haverkort, B.R.: CSL model checking algorithms for infinite-state structured Markov chains
Stoyan, D.: Comparison methods for queues and other stochastics models. J. Wiley and son, Chichester (1976)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Castel-Taleb, H., Pekergin, N. (2009). Weak Stochastic Comparisons for Performability Verification. In: Al-Begain, K., Fiems, D., Horváth, G. (eds) Analytical and Stochastic Modeling Techniques and Applications. ASMTA 2009. Lecture Notes in Computer Science, vol 5513. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02205-0_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-02205-0_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02204-3
Online ISBN: 978-3-642-02205-0
eBook Packages: Computer ScienceComputer Science (R0)