Communicating sequential processes
Communicating sequential processes
A calculus of mobile processes, II
Information and Computation
Comparing the expressive power of the synchronous and the asynchronous &pgr;-calculus
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Anytime, anywhere: modal logics for mobile ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
What is a “good” encoding of guarded choice?
Information and Computation - Special issue on EXPRESS 1997
Theoretical Computer Science
Pict: a programming language based on the Pi-Calculus
Proof, language, and interaction
Information and Computation
Distributed Algorithms
Communication and Concurrency
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
An Object Calculus for Asynchronous Communication
ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Graph Types for Monadic Mobile Processes
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
Expressiveness of Point-to-Point versus Broadcast Communications
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Comparing the expressive power of the synchronous and asynchronous $pi$-calculi
Mathematical Structures in Computer Science
Leader election in rings of ambient processes
Theoretical Computer Science - Expressiveness in concurrency
Information and Computation
On the relative expressive power of asynchronous communication primitives
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Linearity, Persistence and Testing Semantics in the Asynchronous Pi-Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
We compare the expressive power of process calculi by studying the problem of electing a leader in a symmetric network of processes. We consider the π-calculus with mixed choice and with separate choice, value-passing CCS and Mobile Ambients. We provide a unified approach for all these calculi using reduction semantics.