Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
A calculus of mobile processes, II
Information and Computation
Embedding as a tool for language comparison
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
Atomicity and concurrency control in process calculi
Fundamenta Informaticae
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
What is a “good” encoding of guarded choice?
Information and Computation - Special issue on EXPRESS 1997
Theoretical Computer Science
Information and Computation
An improved algorithm for decentralized extrema-finding in circular configurations of processes
Communications of the ACM
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
On Asynchrony in Name-Passing Calculi
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
The Problem of ``Weak Bisimulation up to''
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
A Typing System for a Calculus of Objects
Proceedings of the First JSSST International Symposium on Object Technologies for Advanced Software
Comparing the expressive power of the synchronous and asynchronous $pi$-calculi
Mathematical Structures in Computer Science
A CPS encoding of name-passing in higher-order mobile embedded resources
Theoretical Computer Science - Expressiveness in concurrency
Theoretical Computer Science - Applied semantics: Selected topics
Encoding Catalytic P Systems in π@
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Tutorial on separation results in process calculi via leader election problems
Theoretical Computer Science
Linearity, Persistence and Testing Semantics in the Asynchronous Pi-Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Matching Systems for Concurrent Calculi
Electronic Notes in Theoretical Computer Science (ENTCS)
Efficient Stochastic Simulation of Biological Systems with Multiple Variable Volumes
Electronic Notes in Theoretical Computer Science (ENTCS)
Coordination Models Orc and Reo Compared
Electronic Notes in Theoretical Computer Science (ENTCS)
Comparing communication primitives via their relative expressive power
Information and Computation
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Towards a Unified Approach to Encodability and Separation Results for Process Calculi
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Stochastic biological modelling in the presence of multiple compartments
Theoretical Computer Science
On the Relative Expressive Power of Calculi for Mobility
Electronic Notes in Theoretical Computer Science (ENTCS)
A Reflective Higher-order Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Sequence Types for the π-calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Bigraphical Semantics of Higher-Order Mobile Embedded Resources with Local Names
Electronic Notes in Theoretical Computer Science (ENTCS)
A calculus for orchestration of web services
ESOP'07 Proceedings of the 16th European conference on Programming
A core calculus for a comparative analysis of bio-inspired calculi
ESOP'07 Proceedings of the 16th European conference on Programming
Stochastic simulation of biological systems with dynamical compartment structure
CMSB'07 Proceedings of the 2007 international conference on Computational methods in systems biology
π@: a π-based process calculus for the implementation of compartmentalised bio-inspired calculi
SFM'08 Proceedings of the Formal methods for the design of computer, communication, and software systems 8th international conference on Formal methods for computational systems biology
COORDINATION'08 Proceedings of the 10th international conference on Coordination models and languages
Towards a unified approach to encodability and separation results for process calculi
Information and Computation
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Encoding Cryptographic Primitives in a Calculus with Polyadic Synchronisation
Journal of Automated Reasoning
Namespace logic: a logic for a reflective higher-order calculus
TGC'05 Proceedings of the 1st international conference on Trustworthy global computing
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
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
A calculus for trust management
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
The attributed pi-calculus with priorities
Transactions on Computational Systems Biology XII
Is it a "good" encoding of mixed choice?
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
On distributability in process calculi
ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
| Hi-index | 0.00 |
We extend the π-calculus with polyadic synchronisation, a generalisation of the communication mechanism which allows channel names to be composite. We show that this operator embeds nicely in the theory of π-calculus, we suggest that it permits divergence-free encodings of distributed calculi, and we show that a limited form of polyadic synchronisation can be encoded weakly in π-calculus. After showing that matching cannot be derived in π-calculus, we compare the expressivity of polyadic synchronisation, mixed choice and matching. In particular we show that the degree of synchronisation of a language increases its expressive power by means of a separation result in the style of Palamidessi's result for mixed choice.