{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:47:55Z","timestamp":1725544075452},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540330455"},{"type":"electronic","value":"9783540330462"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11690634_4","type":"book-chapter","created":{"date-parts":[[2006,3,28]],"date-time":"2006-03-28T14:15:28Z","timestamp":1143555328000},"page":"47-62","source":"Crossref","is-referenced-by-count":8,"title":["On the Relative Expressive Power of Asynchronous Communication Primitives"],"prefix":"10.1007","author":[{"given":"Daniele","family":"Gorla","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/11494881_4","volume-title":"Formal Methods for Open Object-Based Distributed Systems","author":"L. Acciai","year":"2005","unstructured":"Acciai, L., Boreale, M.: XPi: a typed process calculus for XML messaging. In: Steffen, M., Zavattaro, G. (eds.) FMOODS 2005. LNCS, vol.\u00a03535, pp. 47\u201366. Springer, Heidelberg (2005)"},{"issue":"2","key":"4_CR2","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0304-3975(97)00223-5","volume":"195","author":"R.M. Amadio","year":"1998","unstructured":"Amadio, R.M., Castellani, I., Sangiorgi, D.: On bisimulations for the asynchronous \u03c0-calculus. Theoretical Computer Science\u00a0195(2), 291\u2013324 (1998)","journal-title":"Theoretical Computer Science"},{"key":"4_CR3","volume-title":"JavaSpaces Principles, Patterns and Practice","author":"K. Arnold","year":"1999","unstructured":"Arnold, K., Freeman, E., Hupfer, S.: JavaSpaces Principles, Patterns and Practice. Addison-Wesley, Reading (1999)"},{"key":"4_CR4","unstructured":"Boudol, G.: Asynchrony and the \u03c0-calculus (note). Rapport de Recherche 1702, INRIA Sophia-Antipolis (May 1992)"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11549970_3","volume-title":"Formal Techniques for Computer Systems and Business Processes","author":"A. Brown","year":"2005","unstructured":"Brown, A., Laneve, C., Meredith, G.: \u03c0duce: a process calculus with native XML datatypes. In: Bravetti, M., Kloul, L., Zavattaro, G. (eds.) EPEW\/WS-EM 2005. LNCS, vol.\u00a03670, Springer, Heidelberg (2005)"},{"issue":"2","key":"4_CR6","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0304-3975(97)00149-7","volume":"192","author":"N. Busi","year":"1998","unstructured":"Busi, N., Gorrieri, R., Zavattaro, G.: A process algebraic view of LINDA coordination primitives. Theoretical Computer Science\u00a0192(2), 167\u2013199 (1998)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"4_CR7","first-page":"70","volume":"10","author":"M. Carbone","year":"2003","unstructured":"Carbone, M., Maffeis, S.: On the expressive power of polyadic synchronisation in \u03c0-calculus. Nordic Journal of Computing\u00a010(2), 70\u201398 (2003)","journal-title":"Nordic Journal of Computing"},{"issue":"1","key":"4_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\u00a0240(1), 177\u2013213 (2000)","journal-title":"Theoretical Computer Science"},{"key":"4_CR9","first-page":"92","volume-title":"Proc. of LICS 2005","author":"G. Castagna","year":"2005","unstructured":"Castagna, G., De Nicola, R., Varacca, D.: Semantic subtyping for the \u03c0-calculus. In: Proc. of LICS 2005, pp. 92\u2013101. IEEE Computer Society Press, Los Alamitos (2005)"},{"issue":"1","key":"4_CR10","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1006\/inco.1994.1004","volume":"108","author":"F. Boer de","year":"1994","unstructured":"de Boer, F., Palamidessi, C.: Embedding as a tool for language comparison. Information and Computation\u00a0108(1), 128\u2013157 (1994)","journal-title":"Information and Computation"},{"key":"4_CR11","unstructured":"De Nicola, R., Gorla, D., Pugliese, R.: On the expressive power of KLAIM-based calculi. Tech. Rep. 09\/, Dip. Informatica, Univ. Roma \u201cLa Sapienza\u201d. To appear in TCS (2004)"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11494881_1","volume-title":"Formal Methods for Open Object-Based Distributed Systems","author":"R. De Nicola","year":"2005","unstructured":"De Nicola, R., Gorla, D., Pugliese, R.: Pattern Matching over a Dynamic Network of Tuple Spaces. In: Steffen, M., Zavattaro, G. (eds.) FMOODS 2005. LNCS, vol.\u00a03535, pp. 1\u201314. Springer, Heidelberg (2005)"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/3-540-48321-7_21","volume-title":"Fundamentals of Computation Theory","author":"C. Ene","year":"1999","unstructured":"Ene, C., Muntean, T.: Expressiveness of point-to-point versus broadcast communications. In: Ciobanu, G., P\u0103un, G. (eds.) FCT 1999. LNCS, vol.\u00a01684, pp. 258\u2013268. Springer, Heidelberg (1999)"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Ford, D., Lehman, T., McLaughry, S., Wyckoff, P.: T Spaces. IBM Systems Journal, 454\u2013474 (August 1998)","DOI":"10.1147\/sj.373.0454"},{"issue":"1","key":"4_CR15","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/2363.2433","volume":"7","author":"D. Gelernter","year":"1985","unstructured":"Gelernter, D.: Generative Communication in Linda. ACM Transactions on Programming Languages and Systems\u00a07(1), 80\u2013112 (1985)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"4_CR16","first-page":"276","volume-title":"Proc. of PODC 1988","author":"M. Herlihy","year":"1988","unstructured":"Herlihy, M.: Impossibility and universality results for wait-free synchronization. In: Proc. of PODC 1988, pp. 276\u2013290. ACM Press, New York (1988)"},{"key":"4_CR17","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":"4_CR18","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)"},{"key":"4_CR19","series-title":"Series F. NATO ASI","volume-title":"Logic and Algebra of Specification","author":"R. Milner","year":"1993","unstructured":"Milner, R.: The polyadic \u03c0-calculus: A tutorial. In: Logic and Algebra of Specification. Series F. NATO ASI, vol.\u00a094, Springer, Heidelberg (1993)"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1007\/3-540-55719-9_114","volume-title":"Automata, Languages and Programming","author":"R. Milner","year":"1992","unstructured":"Milner, R., Sangiorgi, D.: Barbed bisimulation. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol.\u00a0623, pp. 685\u2013695. Springer, Heidelberg (1992)"},{"key":"4_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.2000.2868","volume":"163","author":"U. Nestmann","year":"2000","unstructured":"Nestmann, U., Pierce, B.: Decoding choice encodings. Information and Computation\u00a0163, 1\u201359 (2000)","journal-title":"Information and Computation"},{"issue":"5","key":"4_CR22","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 \u03c0-calculi. Mathematical Structures in Computer Science\u00a013(5), 685\u2013719 (2003)","journal-title":"Mathematical Structures in Computer Science"},{"key":"4_CR23","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/B978-044482830-9\/50026-6","volume-title":"Handbook of Process Algebra","author":"J. Parrow","year":"2001","unstructured":"Parrow, J.: An introduction to the \u03c0-calculus. In: Handbook of Process Algebra, pp. 479\u2013543. Elsevier, Amsterdam (2001)"},{"key":"4_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-540-49382-2_5","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"P. Quaglia","year":"1998","unstructured":"Quaglia, P., Walker, D.: On encoding p\u03c0 in m\u03c0. In: Arvind, V., Ramanujam, R. (eds.) FST TCS 1998. LNCS, vol.\u00a01530, pp. 42\u201351. Springer, Heidelberg (1998)"},{"key":"4_CR25","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1006\/inco.1996.0096","volume":"131","author":"D. Sangiorgi","year":"1996","unstructured":"Sangiorgi, D.: Bisimulation in higher-order process calculi. Information and Computation\u00a0131, 141\u2013178 (1996)","journal-title":"Information and Computation"},{"key":"4_CR26","first-page":"198","volume-title":"Proc. of 23 rd STOC","author":"E. Shapiro","year":"1991","unstructured":"Shapiro, E.: Separating concurrent languages with categories of language embeddings. In: Proc. of 23 rd STOC, pp. 198\u2013208. ACM Press, New York (1991)"},{"key":"4_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/3-540-62034-6_64","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"N. Yoshida","year":"1996","unstructured":"Yoshida, N.: Graph types for monadic mobile processes. In: Chandru, V., Vinay, V. (eds.) FSTTCS 1996. LNCS, vol.\u00a01180, pp. 371\u2013386. Springer, Heidelberg (1996)"},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"Zavattaro, G.: Towards a hierarchy of negative test operators for generative communication. In: Proc. of EXPRESS 1998. ENTCS, vol.\u00a016 (1998)","DOI":"10.1016\/S1571-0661(04)00125-2"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11690634_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T17:19:07Z","timestamp":1555521547000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11690634_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540330455","9783540330462"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/11690634_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}