{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T15:31:35Z","timestamp":1648913495042},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"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":5617,"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":[[1998,3]]},"DOI":"10.1016\/s0304-3975(97)00156-4","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T04:04:58Z","timestamp":1052798698000},"page":"3-32","source":"Crossref","is-referenced-by-count":0,"title":["Linear dynamic Kahn networks are deterministic"],"prefix":"10.1016","volume":"195","author":[{"given":"Arie","family":"de Bruin","sequence":"first","affiliation":[]},{"given":"Shan-Hwei","family":"Nienhuys-Cheng","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0304-3975(97)00156-4_BIB1","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1051\/ita\/1981150201031","article-title":"S\u00e9mantique des processus communicants","volume":"15","author":"Arnold","year":"1981","journal-title":"RAIRO Theor. Inform."},{"key":"10.1016\/S0304-3975(97)00156-4_BIB2","series-title":"Formal Description of Programming Concepts","first-page":"95","article-title":"Some relationships between asynchronous interpreters of a data flow language","author":"Arvind","year":"1978"},{"key":"10.1016\/S0304-3975(97)00156-4_BIB3","first-page":"252","article-title":"Comparative semantics for linear arrays of communicating processes, a study of the UNIX fork and pipe commands","volume":"vol. 711","author":"de Bakker","year":"1993"},{"key":"10.1016\/S0304-3975(97)00156-4_BIB4","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1145\/4472.4473","article-title":"The denotational semantics of dynamic networks of processes","volume":"7","author":"B\u00f6hm","year":"1985","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"10.1016\/S0304-3975(97)00156-4_BIB5","series-title":"Formalization of programming concepts","first-page":"252","article-title":"Scenarios: a model of non-determinate computation","volume":"vol. 107","author":"Brock","year":"1981"},{"key":"10.1016\/S0304-3975(97)00156-4_BIB6","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0167-6423(88)90016-0","article-title":"Nondeterministic data flow programs: how to avoid the merge anomaly","volume":"10","author":"Broy","year":"1988","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/S0304-3975(97)00156-4_BIB7","article-title":"Experiments with continuation semantics: jumps, backtracking, dynamic networks","author":"de Bruin","year":"1986"},{"key":"10.1016\/S0304-3975(97)00156-4_BIB8","unstructured":"A. de Bruin, S.H. Nienhuys-Cheng, Towards a proof of the Kahn principle for linear dynamic networks, Tech. Report cs-eur-94-06, Erasmus University of Rotterdam. Obtainable by anonymous ftp from ftp.cs.few.eur.nl from directory pub\/doc\/techreports\/1994 as eur-cs-94-06."},{"key":"10.1016\/S0304-3975(97)00156-4_BIB9","series-title":"Proc. Math. Foundations of Computer Science","first-page":"242","article-title":"Linear dynamic Kahn networks are deterministic","volume":"vol. 1113","author":"de Bruin","year":"1996"},{"key":"10.1016\/S0304-3975(97)00156-4_BIB10","doi-asserted-by":"crossref","DOI":"10.1145\/942580.807072","article-title":"Recursive definitions of partial functions and their computations","author":"Cadiou","year":"1972"},{"key":"10.1016\/S0304-3975(97)00156-4_BIB11","series-title":"Automata, languages and programming, 9th. Coll.","first-page":"212","article-title":"An operational semantics for pure data flow","volume":"vol. 140","author":"Faustini","year":"1982"},{"key":"10.1016\/S0304-3975(97)00156-4_BIB12","series-title":"Proc. 4th ACM PoDC","first-page":"49","article-title":"A model and proof system for asynchronous networks","author":"Jonsson","year":"1985"},{"key":"10.1016\/S0304-3975(97)00156-4_BIB13","series-title":"Proc. Theoretical Aspects of Computer Software","first-page":"204","article-title":"Towards a complete hierarchy of compositional dataflow networks","volume":"vol. 526","author":"Jonsson","year":"1990"},{"key":"10.1016\/S0304-3975(97)00156-4_BIB14","series-title":"Proc. IFIP74","first-page":"471","article-title":"The semantics of a simple language for parallel programming","author":"Kahn","year":"1974"},{"key":"10.1016\/S0304-3975(97)00156-4_BIB15","series-title":"Proc. IFIP77","first-page":"993","article-title":"Coroutines and networks of parallel processes","author":"Kahn","year":"1977"},{"key":"10.1016\/S0304-3975(97)00156-4_BIB16","series-title":"European Symp. Programming, Saarbr\u00fccken","first-page":"237","article-title":"Denotational semantics of nets with nondeterminism","volume":"vol. 206","author":"Kok","year":"1986"},{"key":"10.1016\/S0304-3975(97)00156-4_BIB17","series-title":"Proc. 5th ACM PoPL","first-page":"214","article-title":"A straight-forward denotational semantics for nondeterminate data flow programs","author":"Kosinski","year":"1978"},{"issue":"1","key":"10.1016\/S0304-3975(97)00156-4_BIB18","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0890-5401(89)90066-7","article-title":"A proof of the Kahn principle for input\/output automata","volume":"82","author":"Lynch","year":"1989","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(97)00156-4_BIB19","doi-asserted-by":"crossref","unstructured":"S.H. Nienhuys-Cheng, A. de Bruin, Kahn's fixed-point characterization for linear dynamic networks, Tech. Report, to appear.","DOI":"10.1007\/3-540-63774-5_133"},{"issue":"2","key":"10.1016\/S0304-3975(97)00156-4_BIB20","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1145\/3149.3155","article-title":"A fixpoint semantics for nondeterministic data flow","volume":"32","author":"Staples","year":"1985","journal-title":"J. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597001564?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597001564?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T13:00:23Z","timestamp":1555419623000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597001564"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0304397597001564"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00156-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}