Abstract
This paper presents a stochastic comparison based method to check state formulas defined over Discrete Time Markov Reward Models. High-level specifications like stochastic Petri nets, Stochastic Automata Networks, Stochastic Process Algebras have been developed to construct large Markov models. However computation of transient and steady-state distributions are limited to relatively small parameter sizes because of the state space explosion problem. Stochastic comparison technique by which both transient and steady-state bounding distributions can be computed, lets to overcome this problem. On the other hand, bounding techniques are useful in Model Checking, since we check generally formulas to see if they meet some bounds or not. We propose to apply stochastic bounding algorithms to construct bounding distributions and to check formulas through these distributions.
This work is partially supported by ACI Sécurité SurePath
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abu-Amsha, O., Vincent, J.M.: An algorithm to bound functionals of Markov chains with large state space. In: 4th INFORMS Conference on Telecommunications, Boca Raton, Florida (1998)
Andova, S., Hermanns, H., Katoen, J.P.: Disrete-time rewards model-checked. In: Larsen, K.G., Niebert, P. (eds.) FORMATS 2003. LNCS, vol. 2791. Springer, Heidelberg (2004)
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.: Automated performance and dependability evaluation using Model Checking. In: Calzarossa, M.C., Tucci, S. (eds.) Performance 2002. LNCS, vol. 2459, pp. 64–88. Springer, Heidelberg (2002)
Benmammoun, M., Fourneau, J.M., Pekergin, N., Troubnikoff, A.: An algorithmic and numerical approach to bound the performance of high speed networks. In: IEEE MASCOTS 2002, Fort Worth, USA, pp. 375–382 (2002)
Clarke, E.M., Emerson, A., Sistla, A.P.: Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Trans. on Programming Languages and Systems 8(2), 244–263 (1986)
D’Argenio, P.R., Jeannet, B., Jensen, H.E., Larsen, K.G.: Reduction and Refinement Strategies for Probabilistic Analysis. In: Hermanns, H., Segala, R. (eds.) PROBMIV 2002, PAPM-PROBMIV 2002, and PAPM 2002. LNCS, vol. 2399, p. 57. Springer, Heidelberg (2002)
Fourneau, J.M., Pekergin, N., Younès, S.: Improving Stochastic Model Checking with Stochastic Bounds. In: SAINT Modelling and Performance Evaluation in Next Generation Internet Workshop (2005)
Fourneau, J.M., Lecoz, M., Pekergin, N., Quessette, F.: An open tool to compute stochastic bounds on steady-state distributions and rewards. In: IEEE MASCOTS 2003, pp. 219–225 (2003)
Fourneau, J.M., Pekergin, N.: An algorithmic approach to stochastic bounds. In: Calzarossa, M.C., Tucci, S. (eds.) Performance 2002. LNCS, vol. 2459, pp. 64–88. Springer, Heidelberg (2002)
Fourneau, J.M., Lecoz, M., Quessette, F.: Algorithms for irreducible and lumpable strong stochastic bound. Linear Algebra and its Applications 386(2004), 167–185 (2004)
Hansson, H., Jonsson, B.: A logic for reasoning about time and reliability. Form. Asp. of Comp. 6, 512–535 (1994)
Haverkort, B., Cloth, L., Hermanns, H., Katoen, J.P.: Model Checking Performability Properties. In: Proc. Dependability Systems and NETWORKS (DSN) 2002. IEEE CS Press, Los Alamitos (2002)
Kulkarni, V.G.: Modeling and Analysis of Stochastic Systems. Chapman& Hall, Sydney (1995)
Kwiatkowska, M., Norman, G., Parker, D.: PRISM: Probabilistic Symbolic Model Checker. In: Field, T., Harrison, P.G., Bradley, J., Harder, U. (eds.) TOOLS 2002. LNCS, vol. 2324, pp. 200–204. Springer, Heidelberg (2002)
Muller, A., Stoyan, D.: Comparison Methods for Stochastic Models and Risks. Wiley, New York (2002)
Pekergin, N.: Stochastic performance bounds by state space reduction. Performance Evaluation 36-37, 1–17 (1999)
Shaked, M., Shantikumar, J.G.: Stochastic Orders and Their Applications. Academic Press, San Diago (1994)
Stewart, W.J.: Introduction to the Numerical Solution of Markov Chains. Princeton University Press, Princeton (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pekergin, N., Younès, S. (2005). Stochastic Model Checking with Stochastic Comparison. In: Bravetti, M., Kloul, L., Zavattaro, G. (eds) Formal Techniques for Computer Systems and Business Processes. EPEW WS-FM 2005 2005. Lecture Notes in Computer Science, vol 3670. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11549970_9
Download citation
DOI: https://doi.org/10.1007/11549970_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28701-8
Online ISBN: 978-3-540-31903-0
eBook Packages: Computer ScienceComputer Science (R0)