Electronic Notes in Theoretical Computer Science · 2002 · 92 citations · 16 references
ComputingComputer ScienceFormal MethodsMessage PassingProgramming LanguagesCompositional SemanticsData SynchronizationDistributed SynchronizationMathematical LanguageCommunication PrimitivesCommunication SemanticsConcurrent SemanticsSynchronization Semantics
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, and makes it possible to derive divergence-free encodings of distributed calculi. We give a separation result between the π-calculus with polyadic synchronisation (eπ) and the original calculus, in the style of an analogous result given by Palamidessi for mixed choice. We encode Local Area π showing how to control the local use of resources in eπ.
16
A calculus of mobile processes, I
Robin Milner, Joachim Parrow, David Walker · Information and Computation · 1992 · 2.8K citations · Full text
A calculus of mobile processes, II
Robin Milner, Joachim Parrow, David Walker · Information and Computation · 1992 · 1.7K citations · Full text
A calculus for cryptographic protocols
Martı́n Abadi, Andrew D. Gordon · 1997 · 1.2K citations · Full text
Luca Cardelli, Andrew D. Gordon · Theoretical Computer Science · 2000 · 1.1K citations
The reflexive CHAM and the join-calculus
Cédric Fournet, Georges Gonthier · 1996 · 453 citations · Full text