Oltea Mihaela Herescu

Learn More
We propose an extension of the asynchronous-calculus with a notion of random choice. We deene 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(More)
We consider the problem of encoding the-calculus with mixed choice into the asynchronous-calculus via a uniform translation while preserving a reasonable semantics. Although it has been shown that this is not possible with an exact encoding, we suggest a randomized approach using a probabilistic extension of the asynchronous-calculus, and we show that our(More)
We consider the problem of encoding the π-calculus with mixed choice into the asynchronous π-calculus via a uniform translation while preserving a reasonable semantics. Although it has been shown that this is not possible with an exact encoding, we suggest a randomized approach using a probabilistic extension of the asynchronous π-calculus, and we show that(More)
We consider a generalization of the dining philosophers problem to arbitrary connection topologies. We focus on symmetric, fully distributed systems, and we address the problem of guaranteeing progress and lockout-freedom, even in presence of adversary schedulers, by using randomized algorithms. We show that the well-known algorithms of Lehmann and Rabin do(More)
We consider the problem of encoding the-calculus (more precisely, the version of the-calculus with mixed choice) into the asynchronous-calculus via a uniform translation preserving a reasonable semantics. Although it has been shown that this is not possible with an exact encoding, we suggest a randomized approach using a probabilistic extension of the(More)
  • 1