{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T14:45:55Z","timestamp":1648737955539},"reference-count":26,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"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":6803,"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":[[1994,12]]},"DOI":"10.1016\/0304-3975(94)00030-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:32Z","timestamp":1027655252000},"page":"289-318","source":"Crossref","is-referenced-by-count":10,"title":["Labelled domains and automata with concurrency"],"prefix":"10.1016","volume":"135","author":[{"given":"Felipe","family":"Bracho","sequence":"first","affiliation":[]},{"given":"Manfred","family":"Droste","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)00030-1_BIB1","first-page":"243","article-title":"Nondeterministic computations \u2014 structure and axioms","volume":"22","author":"Bachmann","year":"1986","journal-title":"Elektron. Inf. verarb. Kybern. EIK"},{"key":"10.1016\/0304-3975(94)00030-1_BIB2","series-title":"Ph.D. Thesis","article-title":"Categories of asynchronous systems","author":"Bednarczyk","year":"1987"},{"key":"10.1016\/0304-3975(94)00030-1_BIB3","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1145\/322108.322122","article-title":"Minimal and optimal computations of recursive programs","volume":"26","author":"Berry","year":"1979","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(94)00030-1_BIB4","doi-asserted-by":"crossref","first-page":"433","DOI":"10.3233\/FI-1988-11406","article-title":"A non-interleaving semantics for CCS based on proved transitions","volume":"11","author":"Boudol","year":"1988","journal-title":"Fundam. Inform."},{"key":"10.1016\/0304-3975(94)00030-1_BIB5","first-page":"669","article-title":"From domains to automata with concurrency","volume":"Vol. 700","author":"Bracho","year":"1993"},{"key":"10.1016\/0304-3975(94)00030-1_BIB6","unstructured":"F. Bracho and M. Droste, From domains to event structures, to appear."},{"key":"10.1016\/0304-3975(94)00030-1_BIB7","series-title":"Progress in Theoretical Computer Science","article-title":"Categorical Combinators, Sequential Algorithms and Functional Programming","author":"Curien","year":"1993"},{"key":"10.1016\/0304-3975(94)00030-1_BIB8","article-title":"Combinatorics on Traces","volume":"Vol. 454","author":"Diekert","year":"1990"},{"key":"10.1016\/0304-3975(94)00030-1_BIB9","first-page":"195","article-title":"Concurrency, automata and domains","volume":"Vol. 443","author":"Droste","year":"1990"},{"key":"10.1016\/0304-3975(94)00030-1_BIB10","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1142\/S0129054192000218","article-title":"Concurrent automata and domains","volume":"3","author":"Droste","year":"1992","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"10.1016\/0304-3975(94)00030-1_BIB11","series-title":"Semantics of Programming Languages and Model Theory","first-page":"69","article-title":"Petri nets and automata with concurrency relations \u2014 an adjunction","author":"Droste","year":"1993"},{"key":"10.1016\/0304-3975(94)00030-1_BIB12","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1145\/359576.359585","article-title":"Communicating sequential processes","volume":"21","author":"Hoare","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(94)00030-1_BIB13","article-title":"Call-by-need computations in non-ambiguous linear term rewriting systems","volume":"Vol. 359","author":"Huet","year":"1979","journal-title":"IRIA-LABORIA Report"},{"key":"10.1016\/0304-3975(94)00030-1_BIB14","series-title":"Semantics for Concurrency Proc. Internat. BCS-FACS Workshop at Leicester","first-page":"262","article-title":"Defining conditional independence using collapses","author":"Katz","year":"1990"},{"key":"10.1016\/0304-3975(94)00030-1_BIB15","series-title":"Dissertation","article-title":"Modelle nebenl\u00e4ufiger Prozesse \u2014 Monoide, Residuensysteme und Automaten","author":"Kuske","year":"1994"},{"key":"10.1016\/0304-3975(94)00030-1_BIB16","series-title":"To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism","first-page":"159","article-title":"Optimal reductions in the lambda calculus","author":"Levy","year":"1980"},{"key":"10.1016\/0304-3975(94)00030-1_BIB17","series-title":"DAIMI Report PB-78","article-title":"Concurrent program schemes and their interpretations","author":"Mazurkiewicz","year":"1977"},{"key":"10.1016\/0304-3975(94)00030-1_BIB18","article-title":"A Calculus of Communicating Systems","volume":"Vol. 92","author":"Milner","year":"1980"},{"key":"10.1016\/0304-3975(94)00030-1_BIB19","first-page":"439","article-title":"Computations, residuals and the power of indeterminacy","volume":"Vol. 317","author":"Panangaden","year":"1988"},{"key":"10.1016\/0304-3975(94)00030-1_BIB20","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1093\/comjnl\/28.5.449","article-title":"Concurrent machines","volume":"28","author":"Shields","year":"1985","journal-title":"Comput. J."},{"key":"10.1016\/0304-3975(94)00030-1_BIB21","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0304-3975(89)90050-9","article-title":"Concurrent transition systems","volume":"64","author":"Stark","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)00030-1_BIB22","series-title":"Proc. Category Theory and Computer Science","first-page":"52","article-title":"Compositional relational semantics for indeterminate dataflow networks","volume":"Vol. 389","author":"Stark","year":"1989"},{"key":"10.1016\/0304-3975(94)00030-1_BIB23","series-title":"5th Conf. on the Mathematical Foundations of Programming Semantics","first-page":"53","article-title":"Connections between a concrete and an abstract model of concurrent systems","volume":"Vol. 442","author":"Stark","year":"1989"},{"key":"10.1016\/0304-3975(94)00030-1_BIB24","series-title":"Category Theory and Computer Science Proc.","first-page":"261","article-title":"Dataflow networks are fibrations","volume":"Vol. 530","author":"Stark","year":"1991"},{"key":"10.1016\/0304-3975(94)00030-1_BIB25","series-title":"Petri Nets: Applications and Relationships to Other Models of Concurrency","first-page":"325","article-title":"Event structures","volume":"Vol. 255","author":"Winskel","year":"1987"},{"key":"10.1016\/0304-3975(94)00030-1_BIB26","unstructured":"G. Winskel and M. Nielsen, Models for concurrency, draft copy of Oct. 1991, in: S. Abramsky, D.M. Gabbay and T.S.E. Maibaum, eds., Handbook of Logic in Computer Science, to appear."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594000301?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594000301?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,14]],"date-time":"2021-05-14T22:54:25Z","timestamp":1621032865000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594000301"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["0304397594000301"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)00030-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}