{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:15:29Z","timestamp":1725495329316},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540658368"},{"type":"electronic","value":"9783540489191"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48919-3_12","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T16:48:02Z","timestamp":1194972482000},"page":"150-165","source":"Crossref","is-referenced-by-count":3,"title":["Comparing Software Architectures for Coordination Languages"],"prefix":"10.1007","author":[{"given":"Marcello M.","family":"Bonsangue","sequence":"first","affiliation":[]},{"given":"Joost N.","family":"Kok","sequence":"additional","affiliation":[]},{"given":"Gianluigi","family":"Zavattaro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,7,18]]},"reference":[{"key":"12_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1007\/3-540-56610-4_64","volume-title":"Proc. of TAPSOFT\u201993","author":"J.-M. Andreoli","year":"1993","unstructured":"J.-M. Andreoli, L. Leth, R. Pareschi, and B. Thomsen. True Concurrency Semantics for a Linear Logic Programming Language with Broadcast Communication. In Proc. of TAPSOFT\u201993, volume 668 of LNCS, pages 182\u2013198, Springer, 1993."},{"issue":"3","key":"12_CR2","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/BF03037173","volume":"9","author":"J.-M. Andreoli","year":"1991","unstructured":"J.-M. Andreoli and R. Pareschi. Linear objects: Logical processes with built-in inheritance. New Generation Computing, 9(3+4):445\u2013473, 1991.","journal-title":"New Generation Computing"},{"key":"12_CR3","unstructured":"F. Arbab, J.W. de Bakker, M.M. Bonsangue, J.J.M.M. Rutten, A. Scutell\u00e1, and G. Zavattaro. A transition system semantics for the control-driven coordination language MANIFOLD. To appear in Theoretical Computer Science, 1999."},{"issue":"1","key":"12_CR4","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1002\/cpe.4330050103","volume":"5","author":"F. Arbab","year":"1993","unstructured":"F. Arbab, I. Herman, and P. Spilling. An overview of Manifold and its implementation. Concurrency: Practice and Experience, 5(1):23\u201370, 1993.","journal-title":"Concurrency: Practice and Experience"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1109\/9.231463","volume":"38","author":"M. Boasson","year":"1993","unstructured":"M. Boasson. Control systems software. In IEEE Transactions on Automatic Control 38:7, pages 1094\u20131107, 1993.","journal-title":"IEEE Transactions on Automatic Control"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"M.M. Bonsangue, J.N. Kok, M. Boasson, and E. de Jong. A software architecture for distributed control systems and its transition system semantics. In Proc. of ACM Symp. on Applied Computing (SAC\u201998), pages 159\u2013168. ACM press, 1998.","DOI":"10.1145\/330560.330664"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"M.M. Bonsangue, J.N. Kok, and G. Zavattaro. Comparing coordination models based on shared distributed replicated data. In Proc. of ACM Symp. on Applied Computing (SAC\u201999). ACM press, 1999.","DOI":"10.1145\/298151.298226"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"A. Brogi and J.-M. Jacquet. On the expressiveness of Linda-like concurrent languages In I. Castellani and C. Palamidessi editors, Proc. of Express\u201998, volume 16(2) of Electronic Notes in Theoretical Computer Science, 1998.","DOI":"10.1016\/S1571-0661(04)00118-5"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"N. Busi, R. Gorrieri, and G. Zavattaro. Comparing Three Semantics for Linda-like Languages. To appear in Theoretical Computer Science, 1999.","DOI":"10.1016\/S0304-3975(99)00227-3"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"N. Busi, R. Gorrieri, and G. Zavattaro. On the Expressiveness of Linda Coordination Primitives. To appear in Information and Computation, 1999.","DOI":"10.1006\/inco.1999.2823"},{"issue":"2","key":"12_CR11","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0304-3975(97)00149-7","volume":"192","author":"N. Busi","year":"1998","unstructured":"N. Busi, R. Gorrieri, and G. Zavattaro. A Process Algebraic View of Linda Coordination Primitives. In Theoretical Computer Science, 192(2): 167\u2013199, 1998.","journal-title":"Theoretical Computer Science"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/63334.63337","volume":"32","author":"N. Carriero","year":"1989","unstructured":"N. Carriero and D. Gelernter. Linda in context. In Communications of the ACM 32:4, pages 444-458, 1989.","journal-title":"Communications of the ACM"},{"key":"12_CR13","series-title":"Lect Notes Comput Sci","first-page":"279","volume-title":"Petri Nets, Applications, and Relationship to other models of Concurrency","author":"A. Mazurkiewicz","year":"1987","unstructured":"A. Mazurkiewicz. Trace theory. In W. Brauer et al., editors, Petri Nets, Applications, and Relationship to other models of Concurrency, volume 255 of LNCS, pages 279\u2013324, Springer-Verlag, 1987."},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1145\/141874.141884","volume":"17","author":"D.E. Perry","year":"1992","unstructured":"D.E. Perry and A. L. Wolf. Foundations for the Study of Software Architecture. In Software Engineering Notes, ACM SIGSOFT vol. 17:4, pages 40\u201352, 1992.","journal-title":"Software Engineering Notes"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"G. Zavattaro. Towards a Hierarchy for Negative Test Operators for Generative Communication. In I. Castellani and C. Palamidessi editors, Proc. of Express\u201998, volume 16(2) of Electronic Notes in Theoretical Computer Science, 1998.","DOI":"10.1016\/S1571-0661(04)00125-2"}],"container-title":["Lecture Notes in Computer Science","Coordinatio Languages and Models"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48919-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T06:55:12Z","timestamp":1556952912000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48919-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540658368","9783540489191"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-48919-3_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}