Information and Computation
Process algebra
Modal logics for mobile processes
Selected papers of the 3rd workshop on Concurrency and compositionality
A calculus of mobile processes, I
Information and Computation
On abstraction and the expressive power of programming languages
TACS'91 Selected papers of the conference on Theoretical aspects of computer software
Testing equivalence for mobile processes
Information and Computation
&pgr;-calculus, internal mobility, and agent-passing calculi
TAPSOFT '95 Selected papers from the 6th international joint conference on Theory and practice of software development
Strong Interaction Fairness Via Randomization
IEEE Transactions on Parallel and Distributed Systems
On bisimulations of the asynchronous &pgr;-calculus
Theoretical Computer Science
Theoretical Computer Science
What is a “good” encoding of guarded choice?
Information and Computation - Special issue on EXPRESS 1997
Pict: a programming language based on the Pi-Calculus
Proof, language, and interaction
Real-Time Synchronization of Interprocess Communications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Information and Computation
On the generalized dining philosophers problem
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Communication and Concurrency
Fault-Tolerant Algorithms for Fair Interprocess Synchronization
IEEE Transactions on Parallel and Distributed Systems
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
An Object Calculus for Asynchronous Communication
ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
Multiway Synchrinizaton Verified with Coupled Simulation
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Testing Probabilistic Automata
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
A Randomized Distributed Encoding of the Pi-Calculus with Mixed Choice
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
Compositional Testing Preorders for Probabilistic Processes
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Comparing the expressive power of the synchronous and asynchronous $pi$-calculi
Mathematical Structures in Computer Science
Randomized dining philosophers without fairness assumption
Distributed Computing
The probabilistic asynchronous pi-calculus
The probabilistic asynchronous pi-calculus
CONCUR 2005 - Concurrency Theory
CONCUR 2005 - Concurrency Theory
Theoretical Computer Science - Automated reasoning for security protocol analysis
Probabilistic and nondeterministic aspects of anonymity
Theoretical Computer Science
An expressiveness study of priority in process calculi
Mathematical Structures in Computer Science
Probabilistic anonymity via coalgebraic simulations
Theoretical Computer Science
Compositional methods for information-hiding
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Making random choices invisible to the scheduler
Information and Computation
Making random choices invisible to the scheduler
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
On the expressive power of global and local priority in process calculi
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
On unique decomposition of processes in the applied π-calculus
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
From software verification to `everyware' verification
Computer Science - Research and Development
| Hi-index | 0.01 |
We consider the problem of encoding the π-calculus with mixed choice (i.e. input/output guarded choice) into the asynchronous π-calculus. We are interested in a translation which satisfies certain desirable properties, namely uniformity and preservation of 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 solution is correct with probability 1 under any proper adversary wrt a notion of testing semantics. This result establishes the basis for a distributed and symmetric implementation of mixed choice which, unlike previous proposals in literature, does not rely on assumptions on the relative speed of processes and it is robust to attacks of proper adversaries.