Generative communication in Linda
ACM Transactions on Programming Languages and Systems (TOPLAS)
An efficiency preorder for processes
Acta Informatica
A calculus of mobile processes, I
Information and Computation
The reflexive CHAM and the join-calculus
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A process algebraic view of Linda coordination primitives
Theoretical Computer Science - Special issue: theoretical aspects of coordination languages
Theoretical Computer Science
Pict: a programming language based on the Pi-Calculus
Proof, language, and interaction
Introduction to Distributed Algorithms
Introduction to Distributed Algorithms
Communication and Concurrency
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
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
On Synchronous and Asynchronous Communication Paradigms
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
The Problem of ``Weak Bisimulation up to''
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Comparing the expressive power of the synchronous and asynchronous $pi$-calculi
Mathematical Structures in Computer Science
Semantic Subtyping for the p-Calculus
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
On the expressive power of KLAIM-based calculi
Theoretical Computer Science - Expressiveness in concurrency
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
PiDuce: a process calculus with native XML datatypes
EPEW'05/WS-FM'05 Proceedings of the 2005 international conference on European Performance Engineering, and Web Services and Formal Methods, international conference on Formal Techniques for Computer Systems and Business Processes
Comparing communication primitives via their relative expressive power
Information and Computation
Towards a Unified Approach to Encodability and Separation Results for Process Calculi
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Towards a unified approach to encodability and separation results for process calculi
Information and Computation
| Hi-index | 0.00 |
We study, from the expressiveness point of view, the impact of synchrony in the communication primitives that arise when combining together some common and useful programming features like arity of data, communication medium and possibility of pattern matching. For some primitives, we show how their synchronous version can be encoded in their asynchronous counterpart via a fully abstract encoding, thus proving that the two versions have the same expressive power. For the remaining primitives, we prove that no 'reasonable' encoding can exist, thus proving that synchrony adds expressiveness to the language.