Abstract
Abrial’s Generalised Substitution Language (GSL) [4] can be modified to operate on arithmetic expressions, rather than Boolean predicates, which allows it to be applied to probabilistic programs [13]. We add a new operator p⊕ to GSL, for probabilistic choice, and we get the probabilistic Generalised Substitution Language (pGSL): a smooth extension of GSL that includes random algorithms within its scope.
In this paper we begin to examine the effect of pGSL on B’s larger-scale structures: its machines. In particular, we suggest a notion of probabilistic machine invariant. We show how these invariants interact with pGSL, at a fine-grained level; and at the other extreme we investigate how they affect our general understanding “in the large” of probabilistic machines and their behaviour.
Overall, we aim to initiate the development of probabilistic B (pB), complete with a suitable probabilistic AMN (pAMN). We discuss the practical extension of the B-Toolkit [5] to support pB, and we give examples to show how pAMN can be used to express and reason about probabilistic properties of a system.
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
Probabilistic symbolic model checker. http://www.cs.bham.ac.uk/~dxp/prism/publications.html.
Specification and development of probabilistic systems. http://web.comlab.ox.ac.uk/oucl/research/areas/probs/.
Proceeding of the 3rd International Conference of B and Z Users. Springer, 2003.
J-R. Abrial. The B-Book. Cambridge University Press, 1996.
B-Core(UK) Ltd. B Toolkit. http://www.b-core.com.
John E. Freund. John E. Freund’s Mathematical Statistics. Prentice Hall International, Inc., 6 edition, 1999.
D. Gries and J. Prins. A new notion of encapsulation. In Symposium on Language Issues in Programming Environments. SIGPLAN, June 1985.
A. K. McIver. Quantitative program logic and counting rounds in probabilistic distributed algorithms. In Proc. 5th Intl. Workshop ARTS’ 99, volume 1601, 1999.
A. K. McIver and C. C. Morgan. Demonic, angelic and unbounded probabilistic choices in sequential programs. Acta Informatica, 37:329–354, 2001.
C. C. Morgan, A. K. McIver, and K. Seidel. Probabilistic predicate transformers. ACM Transactions on Programming Languages and Systems, 18(3):325–353, May 1996.
A. K. McIver, C. C. Morgan, and Thai Son Hoang. Probabilistic termination in B. In Proceeding of the 3rd International Conference of B and Z Users [3].
C. C. Morgan. Programming from Specifications. Prentice-Hall, second edition, 1994. At http://web.comlab.ox.ac.uk/oucl/publications/books/PfS.
C. C. Morgan. The generalised substitution language extended to probabilistic programs. In Proceedings B’98: the 2nd International B Conference, volume 1393 of LNCS, Montpelier, April 1998. Also available at [2, B98].
Stoelinga and Vaandrager. Root contention in IEEE 1394. In Proceedings of the 5th AMAST workshop on real time and probabilistic systems Bamberg, Germany, ARTS’ 1999, volume 1061 of LNCS.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hoang, T.S., Jin, Z., Robinson, K., McIver, A., Morgan, C. (2003). Probabilistic Invariants for Probabilistic Machines. In: Bert, D., Bowen, J.P., King, S., Waldén, M. (eds) ZB 2003: Formal Specification and Development in Z and B. ZB 2003. Lecture Notes in Computer Science, vol 2651. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44880-2_16
Download citation
DOI: https://doi.org/10.1007/3-540-44880-2_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40253-4
Online ISBN: 978-3-540-44880-8
eBook Packages: Springer Book Archive