Computer Science – Programming Languages
Scientific paper
2001-09-03
Jerzy Tiuryn, editor, Proceedings of FOSSACS 2000 (Part of ETAPS 2000), volume 1784 of Lecture Notes in Computer Science, page
Computer Science
Programming Languages
Report version (longer and more complete than the FoSSaCs 2000 version)
Scientific paper
We propose an extension of the asynchronous pi-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 $\pi$-calculus. Finally, we show an implementation of the probabilistic asynchronous pi-calculus in a Java-like language.
Herescu Oltea Mihaela
Palamidessi Catuscia
No associations
LandOfFree
Probabilistic asynchronous pi-calculus does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Probabilistic asynchronous pi-calculus, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Probabilistic asynchronous pi-calculus will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-354684