Matching Systems for Concurrent Calculi | Zendy

Bjørn Haagensen | Zendy; Sergio Maffeis | Zendy; Iain Phillips | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Matching Systems for Concurrent Calculi

Author(s) -

Bjørn Haagensen,

Sergio Maffeis,

Iain Phillips

Publication year - 2008

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2007.11.004

Subject(s) - pi calculus , matching (statistics) , asynchronous communication , computer science , calculus (dental) , process calculus , theoretical computer science , algorithm , mathematics , medicine , computer network , statistics , dentistry

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research