Abstract
We propose an extension of the asynchronous φ-calculus 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. Finally, we show an implementation of the probabilistic asynchronous φ-calculus in a Java-like language. © Springer-Verlag Berlin Heidelberg 2000.
Cite
CITATION STYLE
Herescu, O. M., & Palamidessi, C. (2000). Probabilistic asynchronous φ-calculus. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1784 LNCS, pp. 146–160). Springer Verlag. https://doi.org/10.1007/3-540-46432-8_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
