Matching Systems for Concurrent Calculi

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.

• Type: Journal
• Year: 2008
• Where: ENTCS
• Authors: Bjørn Haagensen, Sergio Maffeis, Iain Phillips
• Keywords: ENTCS 2008, Mobile Ambients, Pi-calculus, Polyadic Synchronisation