×

zbMATH — the first resource for mathematics

Matching systems for concurrent calculi. (English) Zbl 1277.68189
Amadio, Roberto (ed.) et al., Proceedings of the 14th international workshop on expressiveness in concurrency (EXPRESS 2007), Lisbon, Portugal, September 3, 2007. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 194, No. 2, 85-99 (2008).
Summary: 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.
For the entire collection see [Zbl 1276.68007].

MSC:
68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Banach, R. and F. van Breugel, Mobility and modularity: expressing pi-calculus in CCS (extended abstract) (1998), draft
[2] Boreale, M., On the expressiveness of internal mobility in name-passing calculi, Theoretical computer science, 195, 205-226, (1998) · Zbl 0915.68059
[3] Bugliesi, M.; Castagna, G.; Crafa, S., Access control for mobile agents: the calculus of boxed ambients, ACM transactions on programming languages and systems, 26, 57-124, (2004)
[4] Carbone, M.; Maffeis, S., On the expressive power of polyadic synchronisation in π-calculus, Nordic journal of computing, 10, 70-98, (2003) · Zbl 1062.68077
[5] Cardelli, L.; Gordon, A.D., Mobile ambients, Theoretical computer science, 240, 177-213, (2000) · Zbl 0954.68108
[6] De Nicola, R.; Hennessy, M., Testing equivalences for processes, Theoretical computer science, 34, 83-134, (1984) · Zbl 0985.68518
[7] Gorla, D., Comparing calculi for mobility via their relative expressive power, Technical Report 05/2006, Dip. di Informatica, Univ. di Roma “La Sapienza”, Italy (2006)
[8] Merro, M.; Sangiorgi, D., On asynchrony in name-passing calculi, Mathematical structures in computer science, 14, 715-767, (2004) · Zbl 1093.68026
[9] Milner, R., Communicating and mobile systems: the π-calculus, (1999), Cambridge University Press · Zbl 0942.68002
[10] Palamidessi, C., Comparing the expressive power of the synchronous and the asynchronous π-calculi, Mathematical structures in computer science, 13, 685-719, (2003)
[11] Phillips, I.C.C.; Vigliotti, M., Electoral systems in ambient calculi, (), 408-422 · Zbl 1126.68508
[12] Phillips, I.C.C.; Vigliotti, M., Leader election in rings of ambient processes, Theoretical computer science, 356, 468-494, (2006) · Zbl 1092.68068
[13] Sangiorgi, D., π-calculus, internal mobility and agent-passing calculi, Theoretical computer science, 167, 235-274, (1996) · Zbl 0874.68103
[14] Turner, D.N., “The Polymorphic Pi-calculus: Theory and Implementation,” Ph.D. thesis, University of Edinburgh (1995)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.