Matching Systems for Concurrent Calculi

Authors:
Bjørn Haagensen;Sergio Maffeis;Iain Phillips
Affiliations:
Aalborg University, Denmark;Imperial College London;Imperial College London
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 9
Cited 2

&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
On the expressiveness of internal mobility in name-passing calculi

Theoretical Computer Science
Communicating and mobile systems: the &pgr;-calculus

Communicating and mobile systems: the &pgr;-calculus
Mobile ambients

Theoretical Computer Science
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 asynchrony in name-passing calculi

Mathematical Structures in Computer Science
Leader election in rings of ambient processes

Theoretical Computer Science - Expressiveness in concurrency

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

Quantified Score

Hi-index	0.01

Visualization

Abstract

Matching systems were introduced by Carbone and Maffeis, and used to investigate the expressiveness of the pi-calculus with polyadic synchronisation. We adapt their definition and investigate matching systems for CCS, the pi-calculus and Mobile Ambients. We show among other results that the asynchronous pi-calculus with matching cannot be encoded (under certain conditions) in CCS with polyadic synchronisation of all finite levels.