{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T12:48:33Z","timestamp":1649076513181},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,11,1]],"date-time":"1991-11-01T00:00:00Z","timestamp":688953600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7929,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1991,11]]},"DOI":"10.1016\/0304-3975(91)90305-l","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"171-184","source":"Crossref","is-referenced-by-count":2,"title":["Connectedness and synchronization"],"prefix":"10.1016","volume":"90","author":[{"given":"A.","family":"Mazurkiewicz","sequence":"first","affiliation":[]},{"given":"A.","family":"Rabinovich","sequence":"additional","affiliation":[]},{"given":"B.A.","family":"Trakhtenbrot","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(91)90305-L_BIB1","series-title":"Mathematical Foundations of Program Semantics","article-title":"A generalized Kahn principle for abstract asynchronous networks","author":"Abramsky","year":"1990"},{"key":"10.1016\/0304-3975(91)90305-L_BIB2","first-page":"252","article-title":"Scenarios: a model of non-determinate computation","volume":"107","author":"Brock","year":"1981"},{"key":"10.1016\/0304-3975(91)90305-L_BIB3","series-title":"Communicating Sequential Processes","author":"Hoare","year":"1985"},{"key":"10.1016\/0304-3975(91)90305-L_BIB4","article-title":"The semantics of a simple language for parallel programming","volume":"74","author":"Kahn","year":"1974","journal-title":"IFIP"},{"key":"10.1016\/0304-3975(91)90305-L_BIB5","article-title":"Semantics of concurrent systems: a modular fixed point trace approach","volume":"188","author":"Mazurkiewicz","year":"1984"},{"key":"10.1016\/0304-3975(91)90305-L_BIB6","article-title":"Concurrency, modularity and synchronization","volume":"379","author":"Mazurkiewicz","year":"1989"},{"key":"10.1016\/0304-3975(91)90305-L_BIB7","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","article-title":"A calculi for synchrony and asynchrony","volume":"25","author":"Milner","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(91)90305-L_BIB8","article-title":"Equational reasoning about nondeterministic processes","author":"Misra","year":"1989","journal-title":"Proc. PODC"},{"key":"10.1016\/0304-3975(91)90305-L_BIB9","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(81)90112-2","article-title":"Petri nets, event structures, and domains, Part 1","volume":"13","author":"Nielsen","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(91)90305-L_BIB10","series-title":"Communication with automata","author":"Petri","year":"1966"},{"issue":"2","key":"10.1016\/0304-3975(91)90305-L_BIB11","doi-asserted-by":"crossref","DOI":"10.1145\/3318.3480","article-title":"Efficient demand driving evaluation","volume":"7","author":"Pingali","year":"1986","journal-title":"ACM TOPLAS"},{"key":"10.1016\/0304-3975(91)90305-L_BIB12","doi-asserted-by":"crossref","DOI":"10.1007\/BF01379149","article-title":"Modelling concurrency with partial orders","volume":"15","author":"Pratt","year":"1986","journal-title":"Internat. J. Parallel Programming"},{"issue":"4","key":"10.1016\/0304-3975(91)90305-L_BIB13","article-title":"Behavior structure and nets","volume":"11","author":"Rabinovich","year":"1988","journal-title":"Fund. Inform."},{"key":"10.1016\/0304-3975(91)90305-L_BIB14","article-title":"Nets of processes and data flow","volume":"354","author":"Rabinovich","year":"1988"},{"key":"10.1016\/0304-3975(91)90305-L_BIB15","doi-asserted-by":"crossref","DOI":"10.1109\/LICS.1989.39171","article-title":"Nets and data flow interprets","author":"Rabinovich","year":"1989","journal-title":"Proc. 4th Symp. on Logic in Computer Science"},{"key":"10.1016\/0304-3975(91)90305-L_BIB16","series-title":"Technical Report 151\/89","article-title":"Communication among relations (preliminary draft)","author":"Rabinovich","year":"1989"},{"key":"10.1016\/0304-3975(91)90305-L_BIB17","article-title":"Communication among relations","volume":"443","author":"Rabinovich","year":"1990"},{"key":"10.1016\/0304-3975(91)90305-L_BIB18","article-title":"Understanding nets","volume":"379","author":"Trakhtenbrot","year":"1989"},{"key":"10.1016\/0304-3975(91)90305-L_BIB19","series-title":"LUCID, the Data Flow Programming Language","author":"Wadge","year":"1985"},{"issue":"4","key":"10.1016\/0304-3975(91)90305-L_BIB20","article-title":"Event structure representation of the behavior of place\/transition systems","volume":"11","author":"Winkowski","year":"1988","journal-title":"Fund. Inform."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190305L?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190305L?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T06:24:44Z","timestamp":1580883884000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759190305L"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,11]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,11]]}},"alternative-id":["030439759190305L"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(91)90305-l","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1991,11]]}}}