{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:48:52Z","timestamp":1725515332157},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540686767"},{"type":"electronic","value":"9783540686798"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-68679-8_29","type":"book-chapter","created":{"date-parts":[[2008,6,10]],"date-time":"2008-06-10T06:58:16Z","timestamp":1213081096000},"page":"473-492","source":"Crossref","is-referenced-by-count":11,"title":["On the Asynchronous Nature of the Asynchronous \u03c0-Calculus"],"prefix":"10.1007","author":[{"given":"Romain","family":"Beauxis","sequence":"first","affiliation":[]},{"given":"Catuscia","family":"Palamidessi","sequence":"additional","affiliation":[]},{"given":"Frank D.","family":"Valencia","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"#cr-split#-29_CR1.1","doi-asserted-by":"crossref","unstructured":"Amadio, R.M., Castellani, I., Sangiorgi, D.: On bisimulations for the asynchronous \u03c0-calculus. Theoretical Computer Science\u00a0195(2), 291\u2013324 (1998);","DOI":"10.1016\/S0304-3975(97)00223-5"},{"key":"#cr-split#-29_CR1.2","unstructured":"An extended abstract appeared in Sassone, V., Montanari, U. (eds.): CONCUR 1996. LNCS, vol.\u00a01119, pp. 147\u2013162. Springer, Heidelberg (1996)"},{"issue":"1,3","key":"29_CR2","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/S0019-9958(84)80025-X","volume":"60","author":"J. Bergstra","year":"1984","unstructured":"Bergstra, J., Klop, J.: Process algebra for synchronous communication. Information and Control\u00a060(1,3), 109\u2013137 (1984)","journal-title":"Information and Control"},{"key":"29_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/3-540-15670-4_4","volume-title":"Seminar on Concurrency","author":"J.A. Bergstra","year":"1985","unstructured":"Bergstra, J.A., Klop, J.W., Tucker, J.V.: Process algebra with asynchronous communication mechanisms. In: Brookes, S.D., Winskel, G., Roscoe, A.W. (eds.) Seminar on Concurrency. LNCS, vol.\u00a0197, pp. 76\u201395. Springer, Heidelberg (1985)"},{"issue":"2","key":"29_CR4","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1006\/inco.2001.3080","volume":"172","author":"M. Boreale","year":"2002","unstructured":"Boreale, M., Nicola, R.D., Pugliese, R.: Trace and testing equivalence on asynchronous processes. Information and Computation\u00a0172(2), 139\u2013164 (2002)","journal-title":"Information and Computation"},{"key":"29_CR5","unstructured":"Boudol, G.: Asynchrony and the \u03c0-calculus (note). Rapport de Recherche 1702, INRIA, Sophia-Antipolis (1992)"},{"issue":"3","key":"29_CR6","first-page":"560","volume":"31","author":"S. Brookes","year":"1984","unstructured":"Brookes, S., Hoare, C., Roscoe, A.: A theory of communicating sequential processes. J.\u00a0ACM\u00a031(3), 560\u2013599 (1984)","journal-title":"J.\u00a0ACM"},{"issue":"1","key":"29_CR7","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/S0304-3975(99)00227-3","volume":"240","author":"N. Busi","year":"2000","unstructured":"Busi, N., Gorrieri, R., Zavattaro, G.: Comparing three semantics for linda-like languages. Theoretical Computer Science\u00a0240(1), 49\u201390 (2000)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"29_CR8","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0304-3975(99)00231-5","volume":"240","author":"L. Cardelli","year":"2000","unstructured":"Cardelli, L., Gordon, A.D.: Mobile ambients. Theoretical Computer Science (TCS)\u00a0240(1), 177\u2013213 (2000)","journal-title":"Theoretical Computer Science (TCS)"},{"key":"29_CR9","first-page":"137","volume-title":"Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science","author":"F.S. Boer de","year":"1992","unstructured":"de Boer, F.S., Klop, J.W., Palamidessi, C.: Asynchronous communication in process algebra. In: Scedrov, A. (ed.) Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science, Santa Cruz, CA, June 1992, pp. 137\u2013147. IEEE Computer Society Press, Los Alamitos (1992)"},{"key":"29_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/11690634_4","volume-title":"Foundations of Software Science and Computation Structures","author":"D. Gorla","year":"2006","unstructured":"Gorla, D.: On the relative expressive power of asynchronous communication primitives. In: Aceto, L., Ing\u00f3lfsd\u00f3ttir, A. (eds.) FOSSACS 2006. LNCS, vol.\u00a03921, pp. 47\u201362. Springer, Heidelberg (2006)"},{"key":"29_CR11","unstructured":"Gorla, D.: On the criteria for a \u2018good\u2019 encoding: a new approach to encodability and separation results. Technical report, Universit\u00e0 di Roma \u201cLa Sapienza\u201d (2007)"},{"key":"29_CR12","first-page":"459","volume-title":"Programming Concepts and Methods, Proc. of the IFIP WG 2.2\/2.3, Working Conf. on Programming Concepts and Methods","author":"J. He","year":"1990","unstructured":"He, J., Josephs, M.B., Hoare, C.A.R.: A theory of synchrony and asynchrony. In: Broy, M., Jones, C.B. (eds.) Programming Concepts and Methods, Proc. of the IFIP WG 2.2\/2.3, Working Conf. on Programming Concepts and Methods, pp. 459\u2013478. North-Holland, Amsterdam (1990)"},{"key":"29_CR13","volume-title":"Communicating Sequential Processes","author":"C.A.R. Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)"},{"key":"29_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BFb0057019","volume-title":"ECOOP \u201991 European Conference on Object-Oriented Programming","author":"K. Honda","year":"1991","unstructured":"Honda, K., Tokoro, M.: An object calculus for asynchronous communication. In: America, P. (ed.) ECOOP 1991. LNCS, vol.\u00a0512, pp. 133\u2013147. Springer, Heidelberg (1991)"},{"key":"29_CR15","volume-title":"Distributed Algorithms","author":"N. Lynch","year":"1996","unstructured":"Lynch, N.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)"},{"key":"29_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communication Systems","author":"R. Milner","year":"1980","unstructured":"Milner, R.: A Calculus of Communication Systems. LNCS, vol.\u00a092. Springer, Heidelberg (1980)"},{"key":"29_CR17","series-title":"International Series in Computer Science","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. International Series in Computer Science. Prentice-Hall, Englewood Cliffs (1989)"},{"key":"#cr-split#-29_CR18.1","doi-asserted-by":"crossref","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, I and II. Information and Computation\u00a0100(1), 1\u201340 & 41\u201377 (1992);","DOI":"10.1016\/0890-5401(92)90009-5"},{"key":"#cr-split#-29_CR18.2","unstructured":"A preliminary version appeared as Technical Reports ECF-LFCS-89-85 and -86, University of Edinburgh (1989)"},{"key":"29_CR19","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1006\/inco.1999.2822","volume":"156","author":"U. Nestmann","year":"2000","unstructured":"Nestmann, U.: What is a \u2018good\u2019 encoding of guarded choice? Journal of Information and Computation\u00a0156, 287\u2013319 (2000); An extended abstract appeared in the Proceedings of EXPRESS 1997, vol. 7, ENTCS (1997)","journal-title":"Journal of Information and Computation"},{"issue":"5","key":"29_CR20","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1017\/S0960129503004043","volume":"13","author":"C. Palamidessi","year":"2003","unstructured":"Palamidessi, C.: Comparing the expressive power of the synchronous and the asynchronous pi-calculus. Mathematical Structures in Computer Science\u00a013(5), 685\u2013719 (2003); A short version of this paper appeared in POPL 1997","journal-title":"Mathematical Structures in Computer Science"},{"key":"29_CR21","first-page":"455","volume-title":"Proof, Language and Interaction: Essays in Honour of Robin Milner","author":"B.C. Pierce","year":"1998","unstructured":"Pierce, B.C., Turner, D.N.: Pict: A programming language based on the pi-calculus. In: Plotkin, G., Stirling, C., Tofte, M. (eds.) Proof, Language and Interaction: Essays in Honour of Robin Milner, pp. 455\u2013494. MIT Press, Cambridge (1998)"},{"key":"29_CR22","volume-title":"The \u03c0-calculus: a Theory of Mobile Processes","author":"D. Sangiorgi","year":"2001","unstructured":"Sangiorgi, D., Walker, D.: The \u03c0-calculus: a Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)"},{"key":"29_CR23","first-page":"333","volume-title":"Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages","author":"V.A. Saraswat","year":"1991","unstructured":"Saraswat, V.A., Rinard, M., Panangaden, P.: Semantic foundations of concurrent constraint programming. In: Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, pp. 333\u2013352. ACM Press, New York (1991)"},{"key":"29_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1007\/3-540-63141-0_26","volume-title":"CONCUR\u201997: Concurrency Theory","author":"P. Selinger","year":"1997","unstructured":"Selinger, P.: First-order axioms for asynchrony. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol.\u00a01243, pp. 376\u2013390. Springer, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","Concurrency, Graphs and Models"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68679-8_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T01:47:37Z","timestamp":1557625657000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68679-8_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540686767","9783540686798"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68679-8_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}