Series: Logic Seminar

Date: Tuesday, December 7, 1999

Speaker: Catuscia Palamidessi (Penn State, Computer Science)

Title: A Randomized Implementation of the Pi-Calculus with Mixed
Choice, Part 2

Time: 2:30 - 3:20 PM

Place: 122 Thomas Building

Abstract: 

Following the talk of Nov 2 by Mihaela Herescu, we show our encoding
of the pi-calculus into the probabilistic pi-calculus. The
characteristic of this encoding is that it is robust wrt adversary
schedulers, provided that they are "fair" (i.e. do not delay a ready
process forever). We show that our solution is correct with
probability 1 wrt any external observer.