Communicating sequential processes
Communicating sequential processes
A calculus of mobile processes, II
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
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
Communicating sequential processes
Communications of the ACM
Distributed Algorithms
Communication and Concurrency
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
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
Graph Types for Monadic Mobile Processes
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
On Reduction Semantics for the Push and Pull Ambitent Calculus
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
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
On the expressive power of polyadic synchronisation in π-calculus
Nordic Journal of Computing
Access control for mobile agents: The calculus of boxed ambients
ACM Transactions on Programming Languages and Systems (TOPLAS)
Comparing the expressive power of the synchronous and asynchronous $pi$-calculi
Mathematical Structures in Computer Science
On the expressiveness of pure safe ambients
Mathematical Structures in Computer Science
Information and Computation
Leader election in rings of ambient processes
Theoretical Computer Science - Expressiveness in concurrency
Separation of synchronous and asynchronous communication via testing
Theoretical Computer Science
Symmetric electoral systems for ambient calculi
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
Expressiveness of Multiple Heads in CHR
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
On the expressive power of priorities in CHR
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
An expressiveness study of priority in process calculi
Mathematical Structures in Computer Science
On the expressiveness of interaction
Theoretical Computer Science
On the Expressive Power of Multiple Heads in CHR
ACM Transactions on Computational Logic (TOCL)
Expressing global priorities by best-matching
Proceedings of the 27th Annual ACM Symposium on Applied Computing
The expressive power of CHR with priorities
Information and Computation
| Hi-index | 5.23 |
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 @p-calculus with mixed choice, separate choice and internal mobility, value-passing CCS and Mobile Ambients, together with other ambient calculi (Safe Ambients, the Push and Pull Ambient Calculus and Boxed Ambients). We provide a unified approach for all these calculi using reduction semantics.