{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:16:37Z","timestamp":1725664597954},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540594505"},{"type":"electronic","value":"9783540492696"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59450-7_6","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:17:04Z","timestamp":1330276624000},"page":"77-106","source":"Crossref","is-referenced-by-count":9,"title":["On the operational semantics of a coordination language"],"prefix":"10.1007","author":[{"given":"Paolo","family":"Ciancarini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keld K.","family":"Jensen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Yankelevich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"issue":"3\u20134","key":"6_CR1","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/BF03037173","volume":"9","author":"J. Andreoli","year":"1991","unstructured":"Jean-Marc Andreoli and Remo Pareschi. Linear Objects: Logical Processes with Built-in Inheritance. New Generation Computing, 9(3\u20134):445\u2013473, 1991.","journal-title":"New Generation Computing"},{"issue":"3","key":"6_CR2","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1145\/72551.72552","volume":"21","author":"H. Bal","year":"1989","unstructured":"H. Bal, J. Steiner, and A. Tanenbaum. Programming languages for distributed computing systems. ACM Computer Surveys, 21(3):261\u2013322, 1989.","journal-title":"ACM Computer Surveys"},{"issue":"1","key":"6_CR3","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1145\/151233.151242","volume":"36","author":"JP. Banatre","year":"1993","unstructured":"JP. Banatre and D. LeMetayer. Programming by Multiset Transformation. Communications of the ACM, 36(1):98\u2013111, January 1993.","journal-title":"Communications of the ACM"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0304-3975(92)90185-I","volume":"96","author":"G. Berry","year":"1992","unstructured":"G. Berry and G. Boudol. The Chemical Abstract Machine. Theoretical Computer Science, 96:217\u2013248, 1992.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"6_CR5","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1145\/114005.102807","volume":"13","author":"A. Brogi","year":"1991","unstructured":"A. Brogi and P. Ciancarini. The concurrent language Shared Prolog. ACM Transactions on Programming Languages and Systems, 13(1):99\u2013123, 1991.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"4","key":"6_CR6","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1049\/sej.1991.0023","volume":"6","author":"P. Butcher","year":"1991","unstructured":"P. Butcher. A behavioral semantics for Linda-2. IEE Software Engineering Journal, 6(4):196\u2013204, July 1991.","journal-title":"IEE Software Engineering Journal"},{"key":"6_CR7","volume-title":"PhD thesis","author":"N. Carriero","year":"1987","unstructured":"N. Carriero. Implementing Tuple Space Machines. PhD thesis, Dept. of Computer Science, Yale University, New Haven, Connecticut, 1987."},{"unstructured":"N. Carriero and D. Gelernter. New optimization strategies strategies for the Linda Precompiler. In Greg Wilson, editor, Linda-like systems and their implementation, pages 74\u201383. Edimbourgh Computing Center, 1991.","key":"6_CR8"},{"issue":"2","key":"6_CR9","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1145\/129630.129635","volume":"35","author":"N. Carriero","year":"1992","unstructured":"N. Carriero and D. Gelernter. Coordination Languages and Their Significance. Communications of the ACM, 35(2):97\u2013107, February 1992.","journal-title":"Communications of the ACM"},{"key":"6_CR10","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/3-540-52148-8_2","volume":"407","author":"R. Cleaveland","year":"1989","unstructured":"R. Cleaveland and M. Hennessy. Testing Equivalence as a Bisimulation Equivalence. In Proc. Workshop on Automatic Verification for finite-state Systems, volume 407 of Lecture Notes in Computer Science, pages 11\u201323, 1989.","journal-title":"Lecture Notes in Computer Science"},{"doi-asserted-by":"crossref","unstructured":"R. Cridlig and E. Goubault. Semantics and Analysis of Linda-based Languages. In P. Cousot and M. Falaschi and G. File and A. Rauzy, editors, Proc. Int. Workshop on Static Analysis (WSA 93), volume 724 of Lecture Notes in Computer Science, pages 72\u201386, 1993.","key":"6_CR11","DOI":"10.1007\/3-540-57264-3_30"},{"unstructured":"F. deBoer, J. Klop, and C. Palamidessi. Asynchronous Communication in Process Algebra. In Proc. 7th IEEE Symp. on Logic In Computer Science \u2014 LICS. IEEE Computer Society Press, 1992.","key":"6_CR12"},{"doi-asserted-by":"crossref","unstructured":"P. Degano, R. DeNicola, and U. Montanari. A distributed operational semantics for CCS based on Condition\/Event systems. Acta Informatica, pages 59\u201391, 1988.","key":"6_CR13","DOI":"10.1007\/BF02915446"},{"key":"6_CR14","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. DeNicola","year":"1983","unstructured":"R. DeNicola and M. Hennessy. Testing equivalence for processes. Theoretical Computer Science, 34:83\u2013133, 1983.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"6_CR15","doi-asserted-by":"crossref","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"},{"key":"6_CR16","volume-title":"Algebraic Theory of Processes","author":"M. Hennessy","year":"1988","unstructured":"M. Hennessy. Algebraic Theory of Processes. MIT Press, Cambridge, Cambridge, MA, 1988."},{"key":"6_CR17","volume-title":"Technical Report DCS\/RR-783","author":"S. Jagannathan","year":"1990","unstructured":"S. Jagannathan. Semantics and Analysis of First-Class Tuple-Spaces. Technical Report DCS\/RR-783, Dept. of Computer Science, Yale University, New Haven, CT, April 1990."},{"doi-asserted-by":"crossref","unstructured":"K. Jensen. Coloured Petri Nets. In Petri Nets: Central Models and Their Properties, volume 254 of Lecture Notes in Computer Science, 1987.","key":"6_CR18","DOI":"10.1007\/978-3-540-47919-2_10"},{"doi-asserted-by":"crossref","unstructured":"K. Jensen. Decoupling of Computation and Coordination in Linda. In D Heidrich and J Grossetie, editors, Computing with T.Node Parallel Architectures, pages 43\u201362, 1991.","key":"6_CR19","DOI":"10.1007\/978-94-011-3496-5_4"},{"key":"6_CR20","volume-title":"PhD thesis","author":"K. Jensen","year":"1993","unstructured":"K. Jensen. Towards a Multiple Tuple Space Model \u2014 On the Use of SOS in Design and Implementation. PhD thesis, Dept. of CS, Aalborg University, Denmark, 1993 (forth-coming)."},{"key":"6_CR21","volume-title":"PhD thesis","author":"J. Leichter","year":"1989","unstructured":"J. Leichter. Shared Tuple Memories, buses and LANs \u2014 Linda implementations across the spectrum of connectivity. PhD thesis, Dept. of Computer Science, Yale University, New Haven, Connecticut, July 1989."},{"key":"6_CR22","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0890-5401(90)90013-8","volume":"88","author":"J. Meseguer","year":"1990","unstructured":"J. Meseguer and U. Montanari. Petri Nets are Monoids. Information and Computation, 88:105\u2013155, 1990.","journal-title":"Information and Computation"},{"key":"6_CR23","volume-title":"volume 92 of Lecture Notes in Computer Science","author":"R. Milner","year":"1980","unstructured":"R. Milner. A Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1980."},{"key":"6_CR24","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","volume":"25","author":"R. Milner","year":"1983","unstructured":"R. Milner. Calculi for synchrony and asynchrony. Theoretical Computer Science, 25:267\u2013310, 1983.","journal-title":"Theoretical Computer Science"},{"unstructured":"R. Milner. Communication and Concurrency. Prentice Hall, 1989.","key":"6_CR25"},{"issue":"2","key":"6_CR26","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1017\/S0960129500001407","volume":"2","author":"R. Milner","year":"1992","unstructured":"R. Milner. Functions as processes. Mathematical Structures in Computer Science, 2(2):119\u2013141, 1992.","journal-title":"Mathematical Structures in Computer Science"},{"key":"6_CR27","volume-title":"Technical Report TR839","author":"J. Narem","year":"1989","unstructured":"J. Narem. An Informal Operational Semantics of C-Linda version 2.3.5. Technical Report TR839, Dept. of Computer Sc., Yale Univ., New Haven, Connecticut, 1989."},{"unstructured":"J. Peterson. Petri Net Theory and the Modeling of Systems. Prentice Hall, 1981.","key":"6_CR28"},{"key":"6_CR29","volume-title":"Technical Report DAIMI FN-19","author":"G. Plotkin","year":"1981","unstructured":"G. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Department of Computer Science, Aarhus University, Denmark, 1981."},{"key":"6_CR30","volume-title":"EATCS Monographs on Theoretical Computer Science","author":"W. Reisig","year":"1985","unstructured":"W. Reisig. Petri Nets. An Introduction. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin, 1985."},{"issue":"3","key":"6_CR31","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/357139.357142","volume":"3","author":"M. Rem","year":"1981","unstructured":"M. Rem. Associons: A program notation with tuples instead of variables. ACM Transactions on Programming Languages and Systems, 3(3):251\u2013262, July 1981.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"12","key":"6_CR32","doi-asserted-by":"crossref","first-page":"1361","DOI":"10.1109\/32.62445","volume":"16","author":"GC. Roman","year":"1990","unstructured":"GC. Roman and HC.Cunningham. Mixed Programming Metaphors in a Shared Dataspace Model of Concurrency. IEEE Transactions on Software Engineering, 16(12):1361\u20131373, December 1990.","journal-title":"IEEE Transactions on Software Engineering"},{"doi-asserted-by":"crossref","unstructured":"B. Thomsen. A calculus of higher order communicating systems. In 16th ACM Conf. on Principles of Programming Languages, pages 143\u2013154, Austin, Tx, January 1989.","key":"6_CR33","DOI":"10.1145\/75277.75290"}],"container-title":["Lecture Notes in Computer Science","Object-Based Models and Languages for Concurrent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59450-7_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:27:38Z","timestamp":1619573258000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59450-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540594505","9783540492696"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/3-540-59450-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}