1 citations · 1 across the 1 of their papers we have counts for
3 papers
cs.CR2007★ 1 cited
Making Random Choices Invisible to the Scheduler
Konstantinos Chatzikokolakis, Catuscia Palamidessi
When dealing with process calculi and automata which express both nondeterministic and probabilistic behavior, it is customary to introduce the notion of scheduler to solve the non…
cs.PL2001
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
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…