{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:30:41Z","timestamp":1725467441883},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540633839"},{"type":"electronic","value":"9783540695271"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63383-9_82","type":"book-chapter","created":{"date-parts":[[2006,7,17]],"date-time":"2006-07-17T14:27:52Z","timestamp":1153146472000},"page":"205-219","source":"Crossref","is-referenced-by-count":5,"title":["Three semantics of the output operation for generative communication"],"prefix":"10.1007","author":[{"given":"Nadia","family":"Busi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Gorrieri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gianluigi","family":"Zavattaro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,29]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"R. Amadio, I. Castellani, and D. Sangiorgi. On Bisimulations for the Asynchronous \u03c0-Calculus. In Proc. CONCUR'96, volume 1119 of LNCS, pages 147\u2013162, Springer Verlag, 1996.","DOI":"10.1007\/3-540-61604-7_53"},{"key":"14_CR2","unstructured":"G. Boudol. Asynchrony and the \u03c0-calculus. Technical Report 1702, INRIA, Sophia-Antipolis, 1992."},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"N. Busi and R. Gorrieri. A Petri Net Semantics for \u03c0-calculus. In Proc. CONCUR'95, volume 962 of LNCS, pages 145\u2013159, Springer Verlag, 1995.","DOI":"10.1007\/3-540-60218-6_11"},{"key":"14_CR4","unstructured":"N. Busi, R. Gorrieri, and G. Zavattaro. A Truly Concurrent view of Linda Interprocess Communication. Technical Report UBLCS-97-02, Department of Computer Science, University of Bologna, February 1997."},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"N. Busi, R. Gorrieri, and G. Zavattaro. On the Turing Equivalence of Linda Coordination Primitives. Technical Report UBLCS-97-05, Department of Computer Science, University of Bologna, May 1997.","DOI":"10.1016\/S1571-0661(05)80467-0"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"N. Busi, R. Gorrieri, and G. Zavattaro, A Process Algebraic View of Linda Coordination Primitives. To appear in Theoretical Computer Science. Available as Technical Report UBLCS-97-06, Department of Computer Science, University of Bologna, May 1997.","DOI":"10.1016\/S1571-0661(05)80467-0"},{"key":"14_CR7","unstructured":"N. Busi and G.M. Pinna. A Causal Semantics for Contextual P\/T nets. In Proc. ICTCS'95, 311\u2013325, World Scientific, 1995."},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"P. Ciancarini, R. Gorrieri, and G. Zavattaro. Towards a Calculus for Generative Communication. In Proc. 1st IFIP Conf. on FMOODS'96, pages 283\u2013297. Chapman & Hall, 1996.","DOI":"10.1007\/978-0-387-35082-0_21"},{"issue":"1","key":"14_CR9","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/2363.2433","volume":"7","author":"D. Gelernter","year":"1985","unstructured":"D. Gelernter. Generative Communication in Linda. ACM Transactions on Programming Languages and Systems, 7(1):80\u2013112, 1985.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"2","key":"14_CR10","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1145\/129630.129635","volume":"35","author":"D. Gelernter","year":"1992","unstructured":"D. Gelernter and N. Carriero. Coordination Languages and their Significance. Communications of the ACM, 35(2):97\u2013107, 1992.","journal-title":"Communications of the ACM"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0304-3975(93)90111-6","volume":"118","author":"J.F. Groote","year":"1993","unstructured":"J.F. Groote. Transition system specifications with negative premises. Theoretical Computer Science, 118:263\u2013299, 1993.","journal-title":"Theoretical Computer Science"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"M. Hansen, J. Kleist, and H. H\u00fcttel. Bisimulations for Asynchronous Mobile Processes. In Proc. Tbilisi Symposium on Language, Logic, and Computation, 1995.","DOI":"10.7146\/brics.v3i8.19971"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"K. Honda and M. Tokoro. An Object Calculus for Asynchronous Communication. In Proc. ECOOP '91, volume 512 of LNCS, pages 133\u2013147. Springer Verlag, 1991.","DOI":"10.1007\/BFb0057019"},{"key":"14_CR14","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall, 1989."},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"R. Milner and D. Sangiorgi. Barbed Bisimulation. In Proc. ICALP'92, volume 623 of LNCS, pages 685\u2013695, Springer Verlag, 1992.","DOI":"10.1007\/3-540-55719-9_114"},{"key":"14_CR16","unstructured":"M. L. Minsky. Computation: finite and infinite machines. Prentice-Hall, Englewood Cliffs, 1967."},{"issue":"6","key":"14_CR17","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/BF01178907","volume":"32","author":"U. Montanari","year":"1995","unstructured":"U. Montanari and F. Rossi. Contextual Nets. Acta Informatica, 32(6):545\u2013596, 1995.","journal-title":"Acta Informatica"},{"key":"14_CR18","unstructured":"J. E. Narem. An Informal Operational Semantics of C-Linda V2.3.5. Technical Report YALEU\/DCS\/TR-839, Department of Computer Science, Yale University, December 1990."},{"key":"14_CR19","unstructured":"Scientific Computing Associates. Linda: User's guide and reference manual. Scientific Computing Associates, 1995."},{"key":"14_CR20","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1145\/321160.321170","volume":"10","author":"J. C. Shepherdson","year":"1963","unstructured":"J. C. Shepherdson and J. E. Sturgis. Computability of recursive functions. Journal of the ACM, 10:217\u2013255, 1963.","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Coordination Languages and Models"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63383-9_82","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,5]],"date-time":"2024-02-05T10:10:11Z","timestamp":1707127811000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63383-9_82"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540633839","9783540695271"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-63383-9_82","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}