{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:19Z","timestamp":1725663679275},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540512851"},{"type":"electronic","value":"9783540461845"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51285-3_43","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:51:31Z","timestamp":1330203091000},"page":"217-234","source":"Crossref","is-referenced-by-count":5,"title":["Comparing two fully abstract dataflow models"],"prefix":"10.1007","author":[{"given":"Bengt","family":"Jonsson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joost N.","family":"Kok","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"J. D. Brock and W. B. Ackerman. Scenarios: a model of non-determinate computation. In Diaz and Ramos, editors, Formalization of Programming Concepts, LNCS 107, pages 252\u2013259, Springer Verlag, 1981.","DOI":"10.1007\/3-540-10699-5_102"},{"issue":"1","key":"15_CR2","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0304-3975(85)90130-6","volume":"39","author":"R. J. R. Back","year":"1985","unstructured":"R. J. R. Back and H. Mannila. On the suitability of trace semantics for modular proofs of communicating processes. Theoretical Computer Science, 39(1):47\u201368, 1985.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"15_CR3","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0304-3975(82)90021-4","volume":"18","author":"F. Boussinot","year":"1982","unstructured":"F. Boussinot. Proposition de semantique denotationelle pour des processus avec operateur de melange equitable. Theoretical Computer Science, 18(2):173\u2013206, 1982.","journal-title":"Theoretical Computer Science"},{"key":"15_CR4","first-page":"125","volume-title":"Formal Description of Programming Concepts II","author":"M. Broy","year":"1983","unstructured":"M. Broy. Fixed point theory for communication and concurrency. In Bjoerner, editor, Formal Description of Programming Concepts II, pages 125\u2013146, North-Holland, Amsterdam, 1983."},{"key":"15_CR5","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0167-6423(88)90016-0","volume":"10","author":"M. Broy","year":"1988","unstructured":"M. Broy. Nondeterministic data flow programs: how to avoid the merge anomaly. Science of Computer Programming, 10:65\u201385, 1988.","journal-title":"Science of Computer Programming"},{"key":"15_CR6","unstructured":"Z.C. Chen and C.A.R. Hoare. Partial correctness of communicating processes and protocols. Technical Report PRG-20, Programming Research Group, Oxford University, 1981."},{"key":"15_CR7","volume-title":"Compositional Verification of Distributed Systems","author":"B. Jonsson","year":"1987","unstructured":"B. Jonsson. Compositional Verification of Distributed Systems. PhD thesis, Dept. of Computer Systems, Uppsala University, Sweden, Uppsala, Sweden, 1987. Available as report DoCS 87\/09."},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"B. Jonsson. A fully abstract trace model for dataflow networks. In Proceedings of the 16:th ACM Symposium on Principles of Programming Languages, pages 155\u2013165, Austin, Texas, 1989. Available as SICS Research Report 88016.","DOI":"10.1145\/75277.75291"},{"key":"15_CR9","unstructured":"G. Kahn. The semantics of a simple language for parallel programming. In IFIP 74, pages 471\u2013475, North-Holland, 1974."},{"key":"15_CR10","unstructured":"R. M. Keller. Denotational models for parallel programs with indeterminate operators. In Neuhold, editor, Formal Descriptions of Programming Concepts, pages 337\u2013366, North-Holland, 1978."},{"key":"15_CR11","first-page":"237","volume-title":"European Symposium on Programming, Saarbr\u00fccken, LNCS 206","author":"J. N. Kok","year":"1986","unstructured":"J. N. Kok. Denotational semantics of nets with nondeterminism. In European Symposium on Programming, Saarbr\u00fccken, LNCS 206, pages 237\u2013249, Springer Verlag, Saarbr\u00fccken, 1986."},{"key":"15_CR12","first-page":"351","volume":"259","author":"J. N. Kok","year":"1987","unstructured":"J. N. Kok. A fully abstract semantics for data flow nets. In Proc. PARLE, LNCS 259, pages 351\u2013368, Springer Verlag, 1987.","journal-title":"Proc. PARLE, LNCS"},{"key":"15_CR13","volume-title":"Semantic Models for Parallel Computation in Data Flow, Logic and Object-Oriented Languages","author":"J.N. Kok","year":"1989","unstructured":"J.N. Kok. Semantic Models for Parallel Computation in Data Flow, Logic and Object-Oriented Languages. PhD thesis, Free University, Amsterdam, The Netherlands, 1989. To be defended May 11 1989."},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"P. R. Kosinski. A straight-forward denotational semantics for nondeterminate data flow programs. In Proc. 5th ACM Symp. on Principles of Programming Languages, pages 214\u2013219, 1978.","DOI":"10.1145\/512760.512783"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"R. M. Keller and P. Panangaden. Semantics of networks containing indeterminate operators. In Brookes, Roscoe, and Winskel, editors, Seminar on Concurrency 1984, LNCS 197, pages 479\u2013496, 1985.","DOI":"10.1007\/3-540-15670-4_23"},{"key":"15_CR16","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/BF01660035","volume":"1","author":"R. M. Keller","year":"1986","unstructured":"R. M. Keller and P. Panangaden. Semantics of networks containing indeterminate operators. Distributed Computing, 1:235\u2013245, 1986.","journal-title":"Distributed Computing"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"N. A. Lynch and M. R. Tuttle. Hierarchical correctness proofs for distributed algorithms. In Proc. 6th ACM Symp. on Principles of Distributed Computing, pages 137\u2013151, 1987.","DOI":"10.1145\/41840.41852"},{"issue":"4","key":"15_CR18","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1109\/TSE.1981.230844","volume":"SE-7","author":"J. Misra","year":"1982","unstructured":"J. Misra and K. M. Chandy. Proofs of networks of processes. IEEE Transactions on Software Engineering, SE-7(4):417\u2013426, July 1982.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"15_CR19","unstructured":"J. Misra. Reasoning about networks of communicating processes. In INRIA Advanced Nato Study Institute on Logics and Models for Verification and Specification of Concurrent Systems, La Colle sur Loupe, France, 1984."},{"key":"15_CR20","unstructured":"Z. Manna and A. Pnueli. The temporal framework for concurrent programs. In Boyer and Moore, editors, The Correctness Problem in Computer Science, pages 215\u2013274, Academic Press, 1981."},{"key":"15_CR21","unstructured":"D. Park. The \u2018fairness\u2019 problem and nondeterministic computing networks. In de Bakker and van Leeuwen, editors, Foundations of Computer Science IV, Part 2, pages 133\u2013161, Amsterdam, 1983. Mathematical Centre Tracts 159."},{"key":"15_CR22","unstructured":"G. Plotkin. A Structural Approach to Operational Semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981."},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"V. R. Pratt. On the composition of processes. In Proc. 9th ACM Symp. in Principles of Programming Languages, pages 213\u2013223, 1982.","DOI":"10.1145\/582153.582177"},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"V. R. Pratt. The pomset model of parallel processes: unifying the temporal and the spatial. In Brookes, Roscoe, and Winskel, editors, Proc. Seminar on Concurrency, LNCS 197, pages 180\u2013196, Springer Verlag, 1984.","DOI":"10.1007\/3-540-15670-4_9"},{"key":"15_CR25","doi-asserted-by":"crossref","unstructured":"P. Panangaden and G. Stark. Computations, residuals, and the power of indeterminacy. In Lepisto and Salomaa, editors, ICALP 88, pages 133\u2013161, Springer Verlag, 1988.","DOI":"10.1007\/3-540-19488-6_133"},{"issue":"2","key":"15_CR26","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1145\/3149.3155","volume":"32","author":"J. Staples","year":"1985","unstructured":"J. Staples and V. L. Nguyen. A fixpoint semantics for nondeterministic data flow. ACM Journal, 32(2):411\u2013444, April 1985.","journal-title":"ACM Journal"}],"container-title":["Lecture Notes in Computer Science","PARLE '89 Parallel Architectures and Languages Europe"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51285-3_43.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:20:42Z","timestamp":1605648042000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51285-3_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540512851","9783540461845"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-51285-3_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}