| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 424268 | Electronic Notes in Theoretical Computer Science | 2008 | 15 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
