Comparing the expressive power of the synchronous and the asynchronous &pgr;-calculus

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Comparing the expressive power of the synchronous and the asynchronous &pgr;-calculus

Full text

Pdf (818 KB)

Source

Annual Symposium on Principles of Programming Languages archive
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages table of contents

Paris, France

Pages: 256 - 265

Year of Publication: 1997

ISBN:0-89791-853-3

Author

Catuscia Palamidessi

DISI, Università di Genova, via Dodecaneso, 35, 16146 Genova, Italy

Sponsors

L'Ecole des Mines de Paris : L'Ecole des Mines de Paris
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Ctr Natl de la Recherche Sci :
SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 17, Citation Count: 24

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/263699.263731 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	ACS96	Roberto M. Amadio , Ilaria Castellani , Davide Sangiorgi, On Bisimulations for the Asynchronous pi-Calculus, Proceedings of the 7th International Conference on Concurrency Theory, p.147-162, August 26-29, 1996
	BKT85	Jan A. Bergstra , Jan Willem Klop , J. V. Tucker, Process Algebra with Asynchronous Communication Mechanisms, Seminar on Concurrency, Carnegie-Mellon University, p.76-95, July 09-11, 1984
	Bou88	L. Bourgé, On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes, Acta Informatica, v.25 n.2, p.179-201, February 1988
	Bou92	G. Boudol. Asynchrony and the 7r-calculus. Technical Report 1702, INPdA, Sophia- Antipolis, 1992.
	BS96	M. Boreale and D. Sangiorgi. Some congruence properties for 1r-calculus bisimilarities. Technical report, INRIA, Sophia-Antipolis, 1996.
	FR80	N. Francez and M. Rodeh. A distributed abstract data type implemented by a probabilistic communication scheme. In Proc. of the 21st Annual Syrup. on Formal Aspects of Computing, pages 373-379, 1980.
	Hoa78	C. A. R. Hoare, Communicating sequential processes, Communications of the ACM, v.21 n.8, p.666-677, Aug. 1978 [doi>10.1145/359576.359585]
	HT91	Kohei Honda , Mario Tokoro, An Object Calculus for Asynchronous Communication, Proceedings of the European Conference on Object-Oriented Programming, p.133-147, July 15-19, 1991
	HT92	Kohei Honda , Mario Tokoro, On Asynchronous Communication Semantics, Proceedings of the Workshop on Object-Based Concurrent Computing, p.21-51, July 15-16, 1991
	JJH90	He Jifeng, M.B. Josephs, and C.A.R. Hoare. A theory of synchrony and asynchrony. In Proc. of IFIP Working Conference on Programming Concepts and Methods, pages 459- 478, 1990.
	Mil89	R. Milner, Communication and concurrency, Prentice-Hall, Inc., Upper Saddle River, NJ, 1989
	MPW92	Robin Milner , Joachim Parrow , David Walker, A calculus of mobile processes, I, Information and Computation, v.100 n.1, p.1-40, Sept. 1992 [doi>10.1016/0890-5401(92)90008-4]
	NP96	Uwe Nestmann , Benjamin C. Pierce, Decoding Choice Encodings, Proceedings of the 7th International Conference on Concurrency Theory, p.179-194, August 26-29, 1996
	San95	Davide Sangiorgi, &pgr;-calculus, internal mobility, and agent-passing calculi, Theoretical Computer Science, v.167 n.1-2, p.235-274, Oct. 30, 1996

CITED BY 24

	Asis Unyapoth , Peter Sewell, Nomadic pict: correct communication infrastructure for mobile computation, ACM SIGPLAN Notices, v.36 n.3, p.116-127, March 2001
	Koen De Bosschere , Jean-Marie Jacquet, Synchronous coordination in the μLog coordination model, Proceedings of the 2001 ACM symposium on Applied computing, p.151-158, March 2001, Las Vegas, Nevada, United States
	Roberto M. Amadio , Gérard Boudol , Cédric Lhoussaine, On message deliverability and non-uniform receptivity, Fundamenta Informaticae, v.53 n.2, p.105-129, November 2002
	Marcello M. Bonsangue , Joost N. Kok , Gianluigi Zavattaro, Comparing coordination models and architectures using embeddings, Science of Computer Programming, v.46 n.1-2, p.31-69, January/February 2003
	Peter Sewell, π-calculi, Formal methods for distributed processing: a survey of object-oriented approaches, Cambridge University Press, New York, NY, 2001
	Joseph Y. Halpern , Riccardo Pucella, On the relationship between strand spaces and multi-agent systems, Proceedings of the 8th ACM conference on Computer and Communications Security, November 05-08, 2001, Philadelphia, PA, USA
	Oltea Mihaela Herescu , Catuscia Palamidessi, On the generalized dining philosophers problem, Proceedings of the twentieth annual ACM symposium on Principles of distributed computing, p.81-89, August 2001, Newport, Rhode Island, United States
	Marco Carbone , Sergio Maffeis, On the expressive power of polyadic synchronisation in π-calculus, Nordic Journal of Computing, v.10 n.2, p.70-98, Summer 2003
	Catuscia Palamidessi, Mobile calculi for distributed programming, Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming, p.74-75, October 06-08, 2002, Pittsburgh, PA, USA
	Joseph Y. Halpern , Riccardo Pucella, On the relationship between strand spaces and multi-agent systems, ACM Transactions on Information and System Security (TISSEC), v.6 n.1, p.43-70, February 2003
	Tom Chothia , Dominic Duggan, Abstractions for fault-tolerant global computing, Theoretical Computer Science, v.322 n.3, p.567-613, 6 September 2004
	Nobuko Yoshida, Minimality and separation results on asychronous mobile processes-representability theorems by concurrent combinators, Theoretical Computer Science, v.274 n.1-2, p.231-276, March 6, 2002
	Mario Bravetti , Roberto Gorrieri , Roberto Lucchi , Gianluigi Zavattaro, Quantitative information in the tuple space coordination model, Theoretical Computer Science, v.346 n.1, p.28-57, 23 November 2005
	Paola Quaglia , David Walker, Types and full abstraction for polyadic π-calculus, Information and Computation, v.200 n.2, p.215-246, 1 August 2005
	Xudong Guan, Name-passing in an ambient-like calculus and its proof using spatial logic, Theoretical Computer Science, v.356 n.3, p.440-467, 30 May 2006
	Cosimo Laneve , Björn Victor, Solos in concert, Mathematical Structures in Computer Science, v.13 n.5, p.657-683, October 2003
	Catuscia Palamidessi, Comparing the expressive power of the synchronous and asynchronous $pi$-calculi, Mathematical Structures in Computer Science, v.13 n.5, p.685-719, October 2003
	Pascal Zimmer, On the expressiveness of pure safe ambients, Mathematical Structures in Computer Science, v.13 n.5, p.721-770, October 2003
	Kohei Honda, Elementary structures in process theory (1): Sets with renaming, Mathematical Structures in Computer Science, v.10 n.5, p.617-663, October 2000
	Antonio Brogi , Carlos Canal , Ernesto Pimentel, Component adaptation through flexible subservicing, Science of Computer Programming, v.63 n.1, p.39-56, November 2006
	Rana Bakhshi , Dilian Gurov, Verification of Peer-to-peer Algorithms: A Case Study, Electronic Notes in Theoretical Computer Science (ENTCS), 181, p.35-47, June, 2007
	José Proença , Dave Clarke, Coordination Models Orc and Reo Compared, Electronic Notes in Theoretical Computer Science (ENTCS), v.194 n.4, p.57-76, April, 2008
	Rob van Glabbeek , Ursula Goltz , Jens-Wolfhard Schicke, Symmetric and Asymmetric Asynchronous Interaction, Electronic Notes in Theoretical Computer Science (ENTCS), v.229 n.3, p.77-95, July, 2009
	Cristian Versari , Nadia Busi, Stochastic biological modelling in the presence of multiple compartments, Theoretical Computer Science, v.410 n.33-34, p.3039-3064, August, 2009