Probabilistic asynchronous picalculus
Abstract
We propose an extension of the asynchronous picalculus with a notion of random choice. We define an operational semantics which distinguishes between probabilistic choice, made internally by the process, and nondeterministic choice, made externally by an adversary scheduler. This distinction will allow us to reason about the probabilistic correctness of algorithms under certain schedulers. We show that in this language we can solve the electoral problem, which was proved not possible in the asynchronous $\pi$calculus. Finally, we show an implementation of the probabilistic asynchronous picalculus in a Javalike language.
 Publication:

arXiv eprints
 Pub Date:
 September 2001
 arXiv:
 arXiv:cs/0109002
 Bibcode:
 2001cs........9002H
 Keywords:

 Computer Science  Programming Languages;
 D.1.3;
 D.3.2;
 D.3.3
 EPrint:
 Report version (longer and more complete than the FoSSaCs 2000 version)