The challenge of probabilistic event B - Extended abstract

Lecture Notes in Computer Science

Volumn 3455, Issue , 2005, Pages 162-171

  Morgan, Carroll ^a   Hoang, Thai Son ^a   Abrial, Jean Raymond ^b  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

^b ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER AIDED SOFTWARE ENGINEERING; CONCURRENCY CONTROL; PROBABILISTIC LOGICS; PROBLEM SOLVING;

COMPUTATIONAL SEMANTICS; EVENT B; MUTUAL-EXCLUSION ALGORITHM;

SEMANTICS;

EID: 24644438769     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11415787_10     Document Type: Conference Paper

References (26)

1. J.-R. Abrial. The B Book: Assigning Programs to Meanings. Cambridge University Press, 1996.
2. D. Bert, J.P. Bowen, S. King, and M. Waldén, editors. Proc. 3rd Int. ZB Conference, volume 2651 of LNCS. Springer Verlag, 2003.
3. M.J. Butler. A CSP approach to action systems. DPhil thesis, Computing Lab., Oxford University, 1992.
4. M.J. Butler and C.C. Morgan. Action systems, unbounded nondeterminism and infinite traces. Formal Aspects of Computing, 7(1):37-53, 1995.
5. Wei Chen and J.T. Udding. Towards a calculus of data refinement. In J.L.A. van de Snepsheut, editor, Lecture Notes in Computer Science 375: Mathematics of Program Construction. Springer Verlag, June 1989.
6. E.W. Dijkstra. A Discipline of Programming. Prentice Hall International, Englewood Cliffs, N.J., 1976.
7. D. Gries and J. Prins. A new notion of encapsulation. In Symposium on Language Issues in Programming Environments. SIGPLAN, June 1985.
8. Jifeng He, C.A.R. Hoare, and J.W. Sanders. Data refinement refined. In Lecture Notes in Computer Science 213, pages 187-196. Springer Verlag, 1986.
9. Jifeng He, K. Seidel, and A.K. McIver. Probabilistic models for the guarded command language. Science of Computer Programming, 28:171-92, 1997. Available at [15-key HSM95]; dx.doi.org/10.1016/S0167-6423(96)00019-6.
10. Thai Son Hoang, Zhendong Jin, Ken Robinson, Annabelle McIver, Carroll Morgan, and Thai Son Hoang. Development via refinement in probabilistic B -foundation and case study. LNCS. Springer Verlag.
11. Thai Son Hoang, Zhendong Jin, Ken Robinson, Annabelle McIver, Carroll Morgan, and Thai Son Hoang. Probabilistic invariants for probabilistic machines. In Bert et al. [2].
12. D. Kozen. Semantics of probabilistic programs. Jnl. Comp. Sys. Sciences, 22:328-50, 1981.
13. D. Kozen. A probabilistic PDL. Jnl. Comp. Sys. Sciences, 30(2)-.162-78, 1985.
14. Eyal Kushilevitz and M.O. Rabin. Randomized mutual,exclusion algorithms revisited. In Proc. 11th Annual ACM Symp. on Principles of Distributed Computing, 1992.
15. A.K. McIver, C.C. Morgan, J.W. Sanders, and K. Seidel. Probabilistic Systems Group: Collected reports, web.comlab.ox.ac.uk/oucl/research/areas/probs.
16. Annabelle McIver and Carroll Morgan. Abstraction, Refinement and Proof for Probabilistic Systems. Technical Monographs in Computer Science. Springer Verlag, New York, 2004.
17. Annabelle McIver, Carroll Morgan, and Thai Son Hoang. Probabilistic termination in B. In Bert et al. [2].
18. Carroll Morgan. The generalised substitution language extended to probabilistic programs. In Didier Bert, editor, Proc. 2nd Int. B Conference, volume 1393 of LNCS. Springer Verlag, 1998. Also available at [15-B98].
19. C.C. Morgan. The specification statement. ACM Transactions on Programming Languages and Systems, 10(3):403-19, July 1988. Reprinted in [22]; doi.acm.org/10.1145/44501.44503.
20. C.C. Morgan. Of wp and CSP. In W.H.J. Feijen et al., editor, Beauty is Our Business. Springer Verlag, 1990.
21. C.C. Morgan, A.K. McIver, and K. Seidel. Probabilistic predicate transformers. ACM Transactions on Programming Languages and Systems, 18(3):325-53, May 1996. doi.acm.org/10.1145/229542.229547.
22. C.C. Morgan and T.N. Vickers, editors. On the Refinement Calculus. FACIT Series in Computer Science. Springer Verlag, London, 1994.
23. J.M. Morris. A theoretical basis for stepwise refinement and the programming calculus. Science of Computer Programming, 9(3):287-306, December 1987.
24. G. Nelson. A generalization of Dijkstra's calculus. ACM Transactions on Programming Languages and Systems, 11(4):517-61, October 1989.
25. M.O. Rabin. N-process mutual exclusion with bounded waiting by 4 log 2N-valued shared variable. Journal of Computer and System Sciences, 25(1):66-75, 1982.
26. I. Saias. Proving probabilistic correctness statements: the case of Rabin's algorithm for mutual exclusion. In Proc. 11th Annual ACM Symp. on Principles of Distributed Computing, 1992.