Randomized dining philosophers without fairness assumption
Distributed Computing
A randomized encoding of the π-calculus with mixed choice
Theoretical Computer Science - Process algebra
| Hi-index | 0.01 |
In this dissertation, we consider a distributed implementation of the π-calculus, more precisely, the version of the π-calculus with mixed choice. To this end, we present the probabilistic asynchronous π-calculus, which is an extension of the asynchronous π-calculus enhanced 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 π-calculus. We propose a randomized distributed encoding of the π-calculus, using the probabilistic asynchronous π-calculus, and we show that our solution is correct with probability 1 under any proper adversary with respect to a notion of testing semantics. Finally, in order to prove that the probabilistic asynchronous π-calculus is a sensible paradigm for the specification of distributed algorithms, we define a distributed implementation of the synchronization-closed probabilistic asynchronous π-calculus in the Java language.