{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:08:36Z","timestamp":1763467716388},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1994,5,1]],"date-time":"1994-05-01T00:00:00Z","timestamp":767750400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib Comput"],"published-print":{"date-parts":[[1994,5]]},"DOI":"10.1007\/bf02280834","type":"journal-article","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T16:09:20Z","timestamp":1138205360000},"page":"197-212","source":"Crossref","is-referenced-by-count":24,"title":["A fully abstract trace model for dataflow and asynchronous networks"],"prefix":"10.1007","volume":"7","author":[{"given":"Bengt","family":"Jonsson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"BF02280834_CR1","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0020-0190(85)90056-0","volume":"21","author":"B Alpern","year":"1985","unstructured":"Alpern B, Schneider FB: Defining liveness. Inf. Proc. Lett 21 (4): 181\u2013185 (1985)","journal-title":"Inf. Proc. Lett"},{"issue":"1","key":"BF02280834_CR2","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0304-3975(85)90130-6","volume":"39","author":"RJR Back","year":"1985","unstructured":"Back RJR, Mannila H: On the suitability of trace semantics for modular proofs of communicating processes. Theor Comput Sci 39(1): 47\u201368 (1985)","journal-title":"Theor Comput Sci"},{"issue":"2","key":"BF02280834_CR3","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0304-3975(82)90021-4","volume":"18","author":"F Boussinot","year":"1982","unstructured":"Boussinot F: Proposition de semantique denotationelle pour des processus avec operateur de melange equitable. Theor Comput Sci 18(2): 173\u2013206 (1982)","journal-title":"Theor Comput Sci"},{"key":"BF02280834_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/3-540-10699-5_102","volume-title":"Formalization of programming concepts","author":"JD Brock","year":"1981","unstructured":"Brock JD, Ackerman WB: Scenarios: a model of non-determinate computation. In: Diaz J, Ramos I (eds) Formalization of programming concepts. Lect Notes Comput Sci, vol 107. Springer, Berlin Heidelberg New York 1981, pp 252\u2013259"},{"issue":"3","key":"BF02280834_CR5","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"SD Brookes","year":"1984","unstructured":"Brookes SD, Hoare CAR, Roscoe AW: A theory of communicating sequential processes. J ACM 31(3): 560\u2013599 (1984)","journal-title":"J ACM"},{"key":"BF02280834_CR6","first-page":"125","volume-title":"Formal description of programming concepts II","author":"M Broy","year":"1983","unstructured":"Broy M: Fixed point theory for communication and concurrency. In: Bjoerner D (ed) Formal description of programming concepts II. North-Holland, Amsterdam 1983, pp. 125\u2013146"},{"key":"BF02280834_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(86)90040-X","volume":"45","author":"M Broy","year":"1986","unstructured":"Broy M: A theory for nondeterminism, parallelism, communication, and concurrency. Theor Comput Sci 45: 1\u201361 (1986)","journal-title":"Theor Comput Sci"},{"key":"BF02280834_CR8","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0167-6423(88)90016-0","volume":"10","author":"M Broy","year":"1988","unstructured":"Broy M: Nondeterministic data flow programs: How to avoid the merge anomaly. Sci Comput Programm 10: 65\u201385 (1988)","journal-title":"Sci Comput Programm"},{"key":"BF02280834_CR9","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R Nicola de","year":"1984","unstructured":"de Nicola R, Hennessy M: Testing equivalences for processes. Theor Comput Sci 34: 83\u2013133 (1984)","journal-title":"Theor Comput Sci"},{"key":"BF02280834_CR10","volume-title":"Communicating sequential processes","author":"CAR Hoare","year":"1985","unstructured":"Hoare CAR: Communicating sequential processes. Prentice-Hall, New York 1985"},{"key":"BF02280834_CR11","doi-asserted-by":"crossref","unstructured":"Jonsson B: A model and proof system for asynchronous networks. Proc. 4th ACM Symp on Principles of Distributed Computing, 1985, pp 49\u201358","DOI":"10.1145\/323596.323601"},{"key":"BF02280834_CR12","unstructured":"Jonsson B: Compositional verification of distributed systems. Tech Rep DoCS 87\/09, Uppsala University, Dept Compt Sys, 1987. PhD Thesis"},{"key":"BF02280834_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BFb0029628","volume-title":"Proc Mathematical Foundations of Computer Science","author":"B Jonsson","year":"1990","unstructured":"Jonsson B: A hierarchy of compositional models of I\/O-automata. In: Rovan B (ed) Proc Mathematical Foundations of Computer Science. Lect Notes Comput Sci, vol 452. Springer, Berlin Heidelberg New York 1990, pp 347\u2013354"},{"key":"BF02280834_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/3-540-51285-3_43","volume-title":"Proc PARLE '89 vol I","author":"B Jonsson","year":"1989","unstructured":"Jonsson B, Kok JN: Comparing two fully abstract dataflow models. In: Odijk E, Rem M, Syre JC (eds) Proc PARLE '89 vol I. Lect Notes Comput Sci, vol. 365. Springer, Berlin Heidelberg New York 1989, pp. 217\u2013234"},{"key":"BF02280834_CR15","first-page":"471","volume-title":"IFIP 74","author":"G Kahn","year":"1974","unstructured":"Kahn G: The semantics of a simple language for parallel programming. In: IFIP 74. North-Holland, Amsterdam 1974, pp 471\u2013475"},{"key":"BF02280834_CR16","first-page":"337","volume-title":"Formal descriptions of programming concepts","author":"RM Keller","year":"1978","unstructured":"Keller RM: Denotational models for parallel programs with indeterminate operators. In: Neuhold E (ed) Formal descriptions of programming concepts. North-Holland, Amsterdam 1978, pp 337\u2013366"},{"key":"BF02280834_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/3-540-15670-4_23","volume-title":"Seminar on Concurrency 1984","author":"RM Keller","year":"1985","unstructured":"Keller RM, Panangaden P: Semantics of networks containing indeterminate operators. In: Brookes SD, Roscoe AW, Winskel G (eds) Seminar on Concurrency 1984, Lect Notes Comput Sci, vol 197. Springer, Berlin Heidelberg New York 1985, pp 479\u2013496"},{"key":"BF02280834_CR18","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/BF01660035","volume":"1","author":"RM Keller","year":"1986","unstructured":"Keller RM, Panangaden P: Semantics of networks containing indeterminate operators. Distrib Comput 1: 235\u2013245 (1986)","journal-title":"Distrib Comput"},{"key":"BF02280834_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/3-540-16442-1_18","volume-title":"European Symposium on Programming, Saarbr\u00fccken","author":"JN Kok","year":"1986","unstructured":"Kok JN: Denotational semantics of nets with nondeterminism. In: European Symposium on Programming, Saarbr\u00fccken. Lect Notes Comput Sci, vol 206. Springer, Berlin Heidelberg New York 1986, pp 237\u2013249"},{"key":"BF02280834_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/3-540-17945-3_20","volume-title":"Proc PARLE vol II","author":"JN Kok","year":"1987","unstructured":"Kok JN: A fully abstract semantics for data flow nets. In: de Bakker JW, Nijman AJ, Treleaven PC (eds) Proc PARLE vol II. Lect Notes Comput Sci, vol 259. Springer, Berlin Heidelberg New York 1987, pp 351\u2013368"},{"key":"BF02280834_CR21","doi-asserted-by":"crossref","unstructured":"Kosinski PR: A straight-forward denotational semantics for nondeterminate data flow programs. Proc 5th ACM Symp on Principles of Programming Languages, 1978, pp 214\u2013219","DOI":"10.1145\/512760.512783"},{"key":"BF02280834_CR22","doi-asserted-by":"crossref","unstructured":"Lynch NA, Tuttle MR: Hierarchical corretness proofs for Distributed Computing, 1987, pp 137\u2013151","DOI":"10.1145\/41840.41852"},{"key":"BF02280834_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0931-7","volume-title":"The temporal logic of reactive and concurrent systems","author":"Z Manna","year":"1992","unstructured":"Manna Z, Pnueli A: The temporal logic of reactive and concurrent systems. Springer, Berlin Heidelberg New York 1992"},{"key":"BF02280834_CR24","volume-title":"Communication and concurrency","author":"R Milner","year":"1989","unstructured":"Milner R: Communication and concurrency. Prentice-Hall, New York London Toronto Sydney Tokyo 1989"},{"key":"BF02280834_CR25","unstructured":"Misra J: Reasoning about networks of communicating processes. Proc INRIA Advanced Nato Study Institute on Logics and Models for Verification and Specification of Concurrent Systems, La Colle sur Loupe, France 1984"},{"issue":"4","key":"BF02280834_CR26","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1109\/TSE.1981.230844","volume":"7","author":"J Misra","year":"1981","unstructured":"Misra J, Chandy KM: Proofs of networks of processes. IEEE Trans Softw Eng 7(4): 417\u2013426 (1981)","journal-title":"IEEE Trans Softw Eng"},{"issue":"1","key":"BF02280834_CR27","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF01843567","volume":"1","author":"V Nguyen","year":"1986","unstructured":"Nguyen V, Demers A, Gries D, Owicki S: A model and temporal proof system for networks of processes. Distrib Comput 1(1): 7\u201325 (1986)","journal-title":"Distrib Comput"},{"issue":"1","key":"BF02280834_CR28","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF00268075","volume":"23","author":"ER Olderog","year":"1986","unstructured":"Olderog ER, Hoare CAR: Specification-oriented semantics for communicating processes. Acta Inf 23(1): 9\u201366 (1986)","journal-title":"Acta Inf"},{"key":"BF02280834_CR29","unstructured":"Park D: The \u2018fairness\u2019 problem and nondeterministic computing networks In: de Bakker JW, van Leeuwen J (eds) Foundations of computer science IV, part 2. Mathematical Centre Tracts, vol 159. Amsterdam 1983, pp 133\u2013161"},{"key":"BF02280834_CR30","unstructured":"Plotkin G: A structural approach to operational semantics. Tech Rep DAIMI FN-19, Aarhus University, Dept Comp Sci, 1981"},{"key":"BF02280834_CR31","doi-asserted-by":"crossref","unstructured":"Pratt VR: On the composition of processes. Proc 9 th ACM Symp on Principles of Programming Languages, 1982, pp 213\u2013223","DOI":"10.1145\/582153.582177"},{"key":"BF02280834_CR32","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/3-540-15670-4_9","volume-title":"Seminar on Concurrency 1984","author":"VR Pratt","year":"1985","unstructured":"Pratt VR: The pomset model of parallel processes: unifying the temporal and the spatial. In: Brookes SD, Roscoe AW, Winskel G (eds), Seminar on Concurrency 1984. Lect Notes Comput Sci, vol 197, Springer, Berlin Heidelberg New York 1985, pp 180\u2013196"},{"key":"BF02280834_CR33","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1007\/BFb0013036","volume-title":"Linear time, branching time and partial order in logics and models for concurrency","author":"A Rabinovich","year":"1989","unstructured":"Rabinovich A, Trakhtenbrot BA: Nets of processes and data flow. In: de Bakker JW, de Roever WP, Rozenberg G (eds) Linear time, branching time and partial order in logics and models for concurrency. Lect Notes Comput Sci, vol 354. Springer, Berlin Heidelberg New York 1989, pp 574\u2013602"},{"key":"BF02280834_CR34","doi-asserted-by":"crossref","unstructured":"Russe JR: Full abstraction for nondeterministic dataflow networks. Proc 30th IEEE Annual Symp Foundations of Computer Science, 1989","DOI":"10.1109\/SFCS.1989.63474"},{"key":"BF02280834_CR35","doi-asserted-by":"crossref","unstructured":"Russel JR: On oraclizable networks and Kahn's principle. Proc 17th ACM Symp on Principles of Programming Languages, 1990","DOI":"10.1145\/96709.96742"},{"issue":"3","key":"BF02280834_CR36","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0304-3975(83)90017-8","volume":"26","author":"J Staples","year":"1983","unstructured":"Staples J, Nguyen VL: Computing the behaviour of asynchronous processes. Theor Comput Sci 26(3): 343\u2013353 (1983)","journal-title":"Theor Comput Sci"},{"issue":"2","key":"BF02280834_CR37","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1145\/3149.3155","volume":"32","author":"J Staples","year":"1985","unstructured":"Staples J, Nguyen VL: A fixpoint semantics for nondeterministic data flow. J ACM 32(2): 411\u2013444 (1985)","journal-title":"J ACM"},{"key":"BF02280834_CR38","unstructured":"Stark EW: Foundations of a theory of specification for distributed systems. Tech Rep MIT\/LCS\/TR-342, MIT Lab for Computer Science, 1984. PhD thesis"},{"key":"BF02280834_CR39","volume-title":"Lect Notes Comput Sci, vol 321","author":"J Zwiers","year":"1989","unstructured":"Zwiers J: Compositionality, concurrency and partial correctness. Lect Notes Comput Sci, vol 321, Springer, Berlin Heidelberg New York 1989"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02280834.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02280834\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02280834","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T16:53:45Z","timestamp":1558025625000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02280834"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,5]]},"references-count":39,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1994,5]]}},"alternative-id":["BF02280834"],"URL":"https:\/\/doi.org\/10.1007\/bf02280834","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,5]]}}}