{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:47:13Z","timestamp":1762458433049},"reference-count":10,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3803,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1016\/s1571-0661(05)82568-x","type":"journal-article","created":{"date-parts":[[2005,5,19]],"date-time":"2005-05-19T13:46:30Z","timestamp":1116510390000},"page":"284-309","source":"Crossref","is-referenced-by-count":5,"title":["On Modeling Coordination via Asynchronous Communication and Enhanced Matching"],"prefix":"10.1016","volume":"68","author":[{"given":"Antonio","family":"Brogi","sequence":"first","affiliation":[]},{"given":"Jean-Marie","family":"Jacquet","sequence":"additional","affiliation":[]},{"given":"Isabelle","family":"Linden","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)82568-X_BIB1","doi-asserted-by":"crossref","unstructured":"A. Brogi and J.-M. Jacquet. Modeling Coordination via Asynchronous Communication. In D. Garlan and D. Le M\u00e9tayer, editors, Proceedings of the Second International Conference on Coordination Languages and Models, volume 1282 of Lecture Notes in Computer Science, pages 238\u2013255, Berlin, Germany, 1997.","DOI":"10.1007\/3-540-63383-9_84"},{"key":"10.1016\/S1571-0661(05)82568-X_BIB2","series-title":"Proceedings of the Eighth Annual IEEE Symposium on Logic in Computer Science","first-page":"98","article-title":"Full Abstraction for a Shared-Variable Parallel Language","author":"Brookes","year":"1993"},{"issue":"4","key":"10.1016\/S1571-0661(05)82568-X_BIB3","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1145\/63334.63337","article-title":"Linda in Context","volume":"32","author":"Carriero","year":"1989","journal-title":"Communications of the ACM"},{"issue":"2","key":"10.1016\/S1571-0661(05)82568-X_BIB4","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1145\/129630.129635","article-title":"Coordination Languages and Their Significance","volume":"35","author":"Carriero","year":"1992","journal-title":"Communications of the, ACM"},{"key":"10.1016\/S1571-0661(05)82568-X_BIB5","series-title":"Proceedings of The First International Conference on Coordination Models and Languages, number 1061 in LNCS","year":"1996"},{"key":"10.1016\/S1571-0661(05)82568-X_BIB6","series-title":"roc. 2nd Int. Conf. on Concurrency Theory (Concur'91), volume 527 of Lecture Notes in Computer Science, Amsterdam, The Netherlands","first-page":"111","article-title":"The Failure of Failures in a Paradigm of Asynchronous Communication","author":"de Boer","year":"1991"},{"issue":"1","key":"10.1016\/S1571-0661(05)82568-X_BIB7","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1006\/inco.1994.1095","article-title":"Fully abstract denotational models for nonuniform concurrent languages","volume":"115","author":"Horita","year":"1994","journal-title":"Information and computation"},{"key":"10.1016\/S1571-0661(05)82568-X_BIB8","series-title":"A Calculus of communicating systems","author":"Milner","year":"1980"},{"key":"10.1016\/S1571-0661(05)82568-X_BIB9","series-title":"COORDINATION 96, number 1061 in LNCS","article-title":"A process algebra based on Linda","author":"De Nicola","year":"1996"},{"key":"10.1016\/S1571-0661(05)82568-X_BIB10","article-title":"A structural approach to operational semantics","author":"Plotkin","year":"1981","journal-title":"Technical Report DAIMI-FN-19, Aarhus University"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106610582568X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106610582568X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T10:58:14Z","timestamp":1548500294000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S157106610582568X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S157106610582568X"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)82568-x","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}