Abstract
For standard (ie non-probabilistic) systems of reasonable size, correctness is analysed by simulation and/or model checking, possibly with standard program-logical arguments beforehand to reduce the problem size by abstraction.
For probabilistic systems there are model checkers and simulators too; but probabilistic program logics are rarer. Thus e.g. model checkers face more severe exposure to state explosion because “front-end” probabilistic abstraction techniques are not so widely known [18].
We formalise probabilistic refinement of action systems [3] in order to provide just such a front end, and we illustrate with the probabilistic model checker PRISM [21] how it can be used to reduce state explosion. The case study is based on a performance analysis of randomised backoff in wireless communication [1].
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
IEEE 802.11 standard, http://grouper.ieee.org/groups/802/11/main.html
Abrial, J.-R.: Extending B without changing it (for developing distributed systems). In: Habrias, H. (ed.) First Conference on the B Method, Laboratoire LIANA, L’Institut Universitaire de Technologie (IUT) de Nantes, November 1996, pp. 169–190 (1996)
Back, R.-J.R.: A calculus of refinements for program derivations. Acta Informatica 25, 593–624 (1988)
Butler, M.J., Morgan, C.C.: Action systems, unbounded nondeterminism and infinite traces. Formal Aspects of Computing 7(1), 37–53 (1995)
Celiku, O., McIver, A.: Cost-based analysis of probabilistic programs mechanised in HOL. Nordic Journal of Computing (2004)
de Nicola, M., Hennessy, M.: Testing equivalence for processes. Theoretical Computer Science 34 (1984)
Gardiner, P.H.B., Morgan, C.C.: Data refinement of predicate transformers. Theoretical Computer Science 87, 143–162 (1991)
Grimmett, G.R., Welsh, D.: Probability: an Introduction. Oxford Science Publications, Oxford (1986)
Hallerstede, S., Butler, M.: Performance analysis of probabilistic action systems (2005)
Hermanns, H., Herzog, U., Klehmet, U., Mertsiotakis, V., Siegle, M.: Compositional performance modelling with the tipp tool. Performance Evaluation 39, 5–35 (2000)
Hillston, J.: A Compositional Approach to Performance Modelling. Cambridge University Press, Cambridge (1996)
Hoare, C.A.R., He, J., Sanders, J.W.: Prespecification in data refinement. Inf. Proc. Lett. 25(2), 71–76 (1987)
Jonsson, B., Larsen, K.G., Yi, W.: Probabilistic extensions of process algebras. Handbook of Process Algebras (1), 685–710 (2001)
Kwiatkowska, M., Norman, G., Parker, D.: Probabilistic symbolic model checking with PRISM: A hybrid approach. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol. 2280, p. 52. Springer, Heidelberg (2002)
Ajmone Marsan, M., Balbo, G., Conte, G., Donatelli, S., Franceschinis, G.: Modelling with generalised stochastic petri nets. Wiley, New York (1995)
McIver, A.K.: A generalisation of stationary distributions, and probabilistic program algebra. In: Brookes, S., Mislove, M. (eds.) Electronic Notes in Theo. Comp. Sci., vol. 45. Elsevier, Amsterdam (2001)
McIver, A.K., Morgan, C.C.: Results on the quantitative μ-calculus qMμ. In: ACM TOCL (to appear, 2004)
McIver, A., Morgan, C.: Abstraction, Refinement and Proof for Probabilistic Systems. Technical Monographs in Computer Science. Springer, New York (2004)
Morgan, C.C.: Of probabilistic Wp and CSP. 25 years of CSP
Morgan, C.C.: Programming from Specifications, 2nd edn. Prentice-Hall, Englewood Cliffs (1994)
PRISM. Probabilistic symbolic model checker, www.cs.bham.ac.uk/~dxp/prism
Segala, R.: Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis. MIT (1995)
Sere, K., Troubitsyna, E.: Probabilities in action systems. In: Proc. of the 8th Nordic Workshop on Programming Theory (1996)
Stoelinga, M., Vaandrager, F.: Root contention in IEEE 1394. In: Katoen, J.-P. (ed.) AMAST-ARTS 1999, ARTS 1999, and AMAST-WS 1999. LNCS, vol. 1601, pp. 53–74. Springer, Heidelberg (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
McIver, A.K. (2006). Quantitative Refinement and Model Checking for the Analysis of Probabilistic Systems. In: Misra, J., Nipkow, T., Sekerinski, E. (eds) FM 2006: Formal Methods. FM 2006. Lecture Notes in Computer Science, vol 4085. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11813040_10
Download citation
DOI: https://doi.org/10.1007/11813040_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37215-8
Online ISBN: 978-3-540-37216-5
eBook Packages: Computer ScienceComputer Science (R0)