{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:59:52Z","timestamp":1725663592385},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540544159"},{"type":"electronic","value":"9783540476177"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54415-1_47","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:45:29Z","timestamp":1330209929000},"page":"204-225","source":"Crossref","is-referenced-by-count":1,"title":["Towards a complete hierarchy of compositional 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,7]]},"reference":[{"issue":"1","key":"10_CR1","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0304-3975(85)90130-6","volume":"39","author":"R. Back","year":"1985","unstructured":"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":"10_CR2","doi-asserted-by":"publisher","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 pur des processus avec operateur de melange equitable. Theoretical Computer Science, 18(2):173\u2013206, 1982.","journal-title":"Theoretical Computer Science"},{"key":"10_CR3","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/3-540-10699-5_102","volume":"107","author":"J. Brock","year":"1981","unstructured":"J. Brock and W. Ackerman. Scenarios: a model of non-determinate computation. In Formalization of Programming Concepts, LNCS 107, pages 252\u2013259. 1981.","journal-title":"Formalization of Programming Concepts, LNCS"},{"issue":"3","key":"10_CR4","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"S. Brookes","year":"1984","unstructured":"S. Brookes, C. Hoare, and A. Roscoe. A theory of communicating sequential processes. J. ACM, 31(3):560\u2013599, 1984.","journal-title":"J. ACM"},{"key":"10_CR5","first-page":"125","volume":"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, 1983. North-Holland.","journal-title":"Formal Description of Programming Concepts"},{"key":"10_CR6","doi-asserted-by":"publisher","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":"10_CR7","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. Nicola de","year":"1984","unstructured":"R. de Nicola and M. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83\u2013133, 1984.","journal-title":"Theoretical Computer Science"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"C. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.","DOI":"10.1007\/978-3-642-82921-5_4"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"B. Jonsson. A model and proof system for asynchronous networks. In Proc. 4 th ACM PoDC, pages 49\u201358, 1985.","DOI":"10.1145\/323596.323601"},{"key":"10_CR10","volume-title":"Compositional Verification of Distributed Systems","author":"B. Jonsson","year":"1987","unstructured":"B. Jonsson. Compositional Verification of Distributed Systems. PhD thesis, Uppsala University, Sweden, 1987."},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"B. Jonsson. A fully abstract trace model for dataflow networks. In Proc. 16 th ACM PoPL, pages 155\u2013165, 1989.","DOI":"10.1145\/75277.75291"},{"key":"10_CR12","first-page":"347","volume":"452","author":"B. Jonsson","year":"1990","unstructured":"B. Jonsson. A hiearchy of compositional models of I\/O-automata. In Proc. MFCS, LNCS 452, pages 347\u2013354. 1990.","journal-title":"LNCS"},{"key":"10_CR13","first-page":"217","volume":"365","author":"B. Jonsson","year":"1989","unstructured":"B. Jonsson and J. Kok. Comparing two fully absttract dataflow models. In Proc. PARLE 89, LNCS 365, pages 217\u2013234. 1989.","journal-title":"LNCS"},{"key":"10_CR14","first-page":"471","volume":"74","author":"G. Kahn","year":"1974","unstructured":"G. Kahn. The semantics of a simple language for parallel programming. In IFIP 74, pages 471\u2013475. North-Holland, 1974.","journal-title":"IFIP"},{"key":"10_CR15","first-page":"479","volume":"197","author":"R. Keller","year":"1985","unstructured":"R. Keller and P. Panangaden. Semantics of networks containing indeterminate operators. In Seminar on Concurrency 1984, LNCS 197, pages 479\u2013496, 1985.","journal-title":"LNCS"},{"key":"10_CR16","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/BF01660035","volume":"1","author":"R. Keller","year":"1986","unstructured":"R. Keller and P. Panangaden. Semantics of networks containing indeterminate operators. Distributed Computing, 1:235\u2013245, 1986.","journal-title":"Distributed Computing"},{"key":"10_CR17","first-page":"237","volume":"206","author":"J. Kok","year":"1986","unstructured":"J. Kok. Denotational semantics of nets with nondeterminism. In European Symposium on Programming, Saarbr\u00fccken, LNCS 206, pages 237\u2013249. 1986.","journal-title":"LNCS"},{"key":"10_CR18","first-page":"351","volume":"259","author":"J. Kok","year":"1987","unstructured":"J. Kok. A fully abstract semantics for data flow nets. In Proc. PARLE, LNCS 259, pages 351\u2013368. 1987.","journal-title":"LNCS"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"P. Kosinski. A straight-forward denotational semantics for nondeterminate data flow programs. In Proc. 5 th ACM PoPL, pages 214\u2013219, 1978.","DOI":"10.1145\/512760.512783"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"N. Lynch and M. Tuttle. Hierarchical correctness proofs for distributed algorithms. In Proc. 6 th ACM PoDC, pages 137\u2013151, 1987.","DOI":"10.1145\/41840.41852"},{"key":"10_CR21","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall, 1989."},{"issue":"4","key":"10_CR22","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1109\/TSE.1981.230844","volume":"SE-7","author":"J. Misra","year":"1981","unstructured":"J. Misra and K. M. Chandy. Proofs of networks of processes. IEEE Trans. on Software Engineering, SE-7(4):417\u2013426, July 1981.","journal-title":"IEEE Trans. on Software Engineering"},{"issue":"1","key":"10_CR23","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF01843567","volume":"1","author":"V. Nguyen","year":"1986","unstructured":"V. Nguyen, A. Demers, D. Gries, and S. Owicki. A model and temporal proof system for networks of processes. Distributed Computing, 1(1):7\u201325, 1986.","journal-title":"Distributed Computing"},{"issue":"1","key":"10_CR24","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF00268075","volume":"23","author":"E. Olderog","year":"1986","unstructured":"E. Olderog and C. Hoare. Specification-oriented semantics for communicating processes. Acta Informatica, 23(1):9\u201366, 1986.","journal-title":"Acta Informatica"},{"key":"10_CR25","unstructured":"P. Panangaden and V. Shanbhogue. The expressive power of indeterminate dataflow primitives, May 1989. Manuscript."},{"key":"10_CR26","unstructured":"P. Panangaden, V. Shanbhogue, and E. Stark. Stability and sequentiality in dataflow networks. TR 89-1055, Cornell University, Nov. 1989."},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"P. Panangaden and E. Stark. Computations, residuals, and the power of indeterminiacy. In Proc. ICALP '88, LNCS 317, volume 317 of Lecture Notes in Computer Science, pages 439\u2013454. Springer Verlag, 1988.","DOI":"10.1007\/3-540-19488-6_133"},{"issue":"2","key":"10_CR28","first-page":"133","volume":"IV","author":"D. Park","year":"1983","unstructured":"D. Park. The \u2018fairness\u2019 problem and nondeterministic computing networks. In, Foundations of Computer Science IV, Part 2, pages 133\u2013161, Amsterdam, 1983. Mathematical Centre Tracts 159.","journal-title":"Foundations of Computer Science"},{"key":"10_CR29","doi-asserted-by":"crossref","unstructured":"V. Pratt. On the composition of processes. In Proc. 9 th ACM PoPL, pages 213\u2013223, 1982.","DOI":"10.1145\/582153.582177"},{"key":"10_CR30","first-page":"180","volume":"197","author":"V. Pratt","year":"1984","unstructured":"V. Pratt. The pomset model of parallel processes: Unifying the temporal and the spatial. In Proc. Seminar on Concurrency, LNCS 197, pages 180\u2013196. 1984.","journal-title":"LNCS"},{"key":"10_CR31","first-page":"574","volume":"354","author":"A. Rabinovich","year":"1989","unstructured":"A. Rabinovich and B. Trakhtenbrot. Nets of processes and data flow. In Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, LNCS 354, pages 574\u2013602. 1989.","journal-title":"LNCS"},{"key":"10_CR32","first-page":"314","volume":"226","author":"G. Reed","year":"1986","unstructured":"G. Reed and A. Roscoe. A timed model for communicating sequential processes. In Proc. ICALP '86, LNCS 226, pages 314\u2013323. 1986.","journal-title":"LNCS"},{"key":"10_CR33","doi-asserted-by":"crossref","unstructured":"G. Reed and A. Roscoe. Metric spaces as models for real-time concurrency. In Proc. 3 rd Workshop on Math. Found. of Progr. Lang. Semantics, LNCS 298. Springer Verlag, 1988.","DOI":"10.1007\/3-540-19020-1_17"},{"key":"10_CR34","doi-asserted-by":"crossref","unstructured":"J. Russell. Full abstraction for nondeterministic dataflow networks. In Proc. 30th IEEE FoCS, 1989.","DOI":"10.1109\/SFCS.1989.63474"},{"issue":"2","key":"10_CR35","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1145\/3149.3155","volume":"32","author":"J. Staples","year":"1985","unstructured":"J. Staples and V. Nguyen. A fixpoint semantics for nondeterministic data flow. J. ACM, 32(2):411\u2013444, April 1985.","journal-title":"J. ACM"},{"key":"10_CR36","first-page":"224","volume":"259","author":"R. J. Glabbeek van","year":"1987","unstructured":"R. J. van Glabbeek and F. W. Vaandrager. Petri net models for algebraic theories of concurency. In Proc. PARLE, LNCS 259, pages 224\u2013242. 1987.","journal-title":"LNCS"},{"key":"10_CR37","unstructured":"J. Zwiers. Compositionality, Concurrency and Partial Correctness, LNCS 321. 1989."}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computer Software"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54415-1_47.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:54:11Z","timestamp":1605646451000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54415-1_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540544159","9783540476177"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/3-540-54415-1_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}