Computing Publications

Publications Home » Matching systems for concurrent calculi

Matching systems for concurrent calculi

Haagensen, Sergio Maffeis, Iain Phillips

Conference or Workshop Paper
14th International Workshop on Expressiveness in Concurrency (Express'07)
January, 2008
Electronic Notes in Theoretical Computer Science
Volume 194
Issue 2
pp.85–99
Elsevier
DOI 10.1016/j.entcs.2007.11.004
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.

BibTEX file for the publication
 

pubs.doc.ic.ac.uk: built & maintained by Ashok Argent-Katwala.