{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,22]],"date-time":"2022-04-22T09:12:54Z","timestamp":1650618774821},"reference-count":43,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2014,11,10]],"date-time":"2014-11-10T00:00:00Z","timestamp":1415577600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[2015,5]]},"abstract":"<jats:p>The paper is devoted to an analysis of the concurrent features of asynchronous systems. A preliminary step is represented by the introduction of a non-interleaving extension of barbed equivalence. This notion is then exploited in order to prove that<jats:italic>concurrency cannot be observed<\/jats:italic>through asynchronous interactions, i.e., that the interleaving and concurrent versions of a suitable asynchronous weak equivalence actually coincide. The theory is validated on some case studies, related to nominal calculi (\u03c0-calculus) and visual specification formalisms (Petri nets). Additionally, we prove that a class of systems which is deemed (output-buffered) asynchronous, according to a characterization that was previously proposed in the literature, falls into our theory.<\/jats:p>","DOI":"10.1017\/s0960129513000108","type":"journal-article","created":{"date-parts":[[2014,11,10]],"date-time":"2014-11-10T11:41:17Z","timestamp":1415619677000},"page":"978-1004","source":"Crossref","is-referenced-by-count":1,"title":["Concurrency cannot be observed, asynchronously"],"prefix":"10.1017","volume":"25","author":[{"given":"PAOLO","family":"BALDAN","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"FILIPPO","family":"BONCHI","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"FABIO","family":"GADDUCCI","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"GIACOMA VALENTINA","family":"MONREALE","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2014,11,10]]},"reference":[{"key":"S0960129513000108_ref43","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-17945-3_13"},{"key":"S0960129513000108_ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2009.06.040"},{"key":"S0960129513000108_ref40","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0039066"},{"key":"S0960129513000108_ref39","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63141-0_26"},{"key":"S0960129513000108_ref35","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129503004043"},{"key":"S0960129513000108_ref34","doi-asserted-by":"crossref","DOI":"10.1016\/S1571-0661(04)00024-6","article-title":"Concurrent semantics for the \u03c0-calculus","volume":"1","author":"Montanari","year":"1995","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"S0960129513000108_ref33","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-55719-9_114"},{"key":"S0960129513000108_ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27755-2_19"},{"key":"S0960129513000108_ref31","volume-title":"Communicating and Mobile Systems: the \u03c0-Calculus","author":"Milner","year":"1999"},{"key":"S0960129513000108_ref26","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63139-9_39"},{"key":"S0960129513000108_ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85361-9_38"},{"key":"S0960129513000108_ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlap.2004.01.006"},{"key":"S0960129513000108_ref18","first-page":"137","volume-title":"Proceeding of LICS'92","author":"de Boer","year":"1992"},{"key":"S0960129513000108_ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0035764"},{"key":"S0960129513000108_ref15","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00231-5"},{"key":"S0960129513000108_ref12","article-title":"Event structure semantics for dynamic graph grammars","volume":"2","author":"Bruni","year":"2006","journal-title":"EASST"},{"key":"S0960129513000108_ref11","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-54345-7_52"},{"key":"S0960129513000108_ref8","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.18.4"},{"key":"S0960129513000108_ref25","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00074-7"},{"key":"S0960129513000108_ref7","first-page":"76","volume-title":"Seminar on Concurrency","author":"Bergstra","year":"1984"},{"key":"S0960129513000108_ref5","doi-asserted-by":"publisher","DOI":"10.1017\/S0960129504004311"},{"key":"S0960129513000108_ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17164-2_29"},{"key":"S0960129513000108_ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04081-8_8"},{"key":"S0960129513000108_ref30","volume-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"S0960129513000108_ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69507-3_33"},{"key":"S0960129513000108_ref13","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-60218-6_11"},{"key":"S0960129513000108_ref2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61604-7_53"},{"key":"S0960129513000108_ref10","unstructured":"Boudol G. (1992) Asynchrony and the \u03c0-calculus. Technical Report 1702, INRIA."},{"key":"S0960129513000108_ref20","doi-asserted-by":"publisher","DOI":"10.1145\/237721.237805"},{"key":"S0960129513000108_ref29","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45061-0_47"},{"key":"S0960129513000108_ref23","doi-asserted-by":"crossref","first-page":"287","DOI":"10.3233\/FI-1996-263404","article-title":"Graph grammars with negative application conditions","volume":"26","author":"Habel","year":"1996","journal-title":"Fundamenta Informaticae"},{"key":"S0960129513000108_ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71389-0_22"},{"key":"S0960129513000108_ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00125-4"},{"key":"S0960129513000108_ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74407-8_22"},{"key":"S0960129513000108_ref19","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0013030"},{"key":"S0960129513000108_ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68679-8_29"},{"key":"S0960129513000108_ref14","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00227-3"},{"key":"S0960129513000108_ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2005.02.008"},{"key":"S0960129513000108_ref41","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-51486-4_71"},{"key":"S0960129513000108_ref24","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0057019"},{"key":"S0960129513000108_ref28","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44618-4_19"},{"key":"S0960129513000108_ref1","doi-asserted-by":"publisher","DOI":"10.1145\/633642.803973"},{"key":"S0960129513000108_ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlap.2007.06.005"}],"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129513000108","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,21]],"date-time":"2022-04-21T21:52:26Z","timestamp":1650577946000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129513000108\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,10]]},"references-count":43,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,5]]}},"alternative-id":["S0960129513000108"],"URL":"https:\/\/doi.org\/10.1017\/s0960129513000108","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,10]]}}}