5 citations · 6 across the 2 of their papers we have counts for
2 papers
cs.PL2001★ 1 cited
On the generalized dining philosophers problem
Oltea Mihaela Herescu, Catuscia Palamidessi
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…
cs.PL2001★ 5 cited
Probabilistic asynchronous pi-calculus
Oltea Mihaela Herescu, Catuscia Palamidessi
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 in…