{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T12:40:04Z","timestamp":1736167204038,"version":"3.32.0"},"publisher-location":"Berlin\/Heidelberg","reference-count":27,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540528261"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0032040","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T06:05:31Z","timestamp":1134281131000},"page":"294-307","source":"Crossref","is-referenced-by-count":9,"title":["Communication among relations"],"prefix":"10.1007","author":[{"given":"A.","family":"Rabinovich","sequence":"first","affiliation":[]},{"given":"B. A.","family":"Trakhtenbrot","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"S. Abramsky, A generalized Kahn principle for abstract asynchronous networks, in Mathematical Foundations of Program Semantics, Springer Verlag, 1990 (to appear).","DOI":"10.1007\/BFb0040252"},{"key":"24_CR2","first-page":"252","volume":"107","author":"J.D Brock","year":"1981","unstructured":"Brock, J.D and Ackerman, W.B, Scenarios: A Model of Non-Determinate Computation, In Formalization of Programming Concepts, LNCS 107, 1981, 252\u2013259.","journal-title":"LNCS"},{"key":"24_CR3","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BF01786252","volume":"2","author":"M. Broy","year":"1987","unstructured":"Broy, M., Semantics of finite and infinite networks of concurrent communicating agents, Distributed Computing (1987) 2:13\u201331","journal-title":"Distributed Computing"},{"key":"24_CR4","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 Dataflow programs: how to avoid the merge anomaly, in Science of Computer Programming 10, 1988, pp. 65\u201385.","journal-title":"Science of Computer Programming"},{"key":"24_CR5","first-page":"212","volume":"140","author":"A.A. Faustini","year":"1982","unstructured":"Faustini, A.A., An Operational Semantics for Pure Dataflow, LNCS 140, 1982, 212\u2013224.","journal-title":"LNCS"},{"key":"24_CR6","unstructured":"Gaifman, H., Pratt, V.R., Partial Order Models of Concurrency and the Computation of Functions, LICS 1987."},{"key":"24_CR7","unstructured":"Lynch, N., Stark, E., A Proof of the Kahn Principle for Input\/Output Automata. Report MIT\/LCS\/TM-349 1988"},{"key":"24_CR8","unstructured":"Kahn, G., The Semantics of a Simple Language for Parallel Programming, IFIP 74."},{"key":"24_CR9","volume-title":"Reasoning about Nondeterministic Data Flow","author":"P. F. Kearney","year":"1988","unstructured":"P. F. Kearney, Reasoning about Nondeterministic Data Flow, 1988, Ph. D. Thesis Un. Queensland, Australia."},{"key":"24_CR10","unstructured":"J. N. Kok, Semantic Models for Parallel Computation in Data Flow, Logic and Object Oriented Programming, Ph.D. Thesis, CWI, 1989."},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"A. Mazurkiewicz, Semantics of Concurrent Systems: A modular fixed point trace approach, in Advanced in Petri nets 1984, LNCS 188.","DOI":"10.1007\/3-540-15204-0_20"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"A. Mazurkiewicz, Concurrency, Modularity and Synchronization, MFCS 1989, LNCS 379.","DOI":"10.1007\/3-540-51486-4_103"},{"key":"24_CR13","unstructured":"Meyer, Albert R., Anomalies and principles of dataflow process theory, in \"Computer Science: an MIT Perspective\", MIT Press, 1990, to appear."},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Misra J,. Equational Reasoning About Nondeterministic Processes, in Proceedings of PODC 1989","DOI":"10.1145\/72981.72983"},{"key":"24_CR15","unstructured":"D. Park, The \"fairness\" problem and nondeterministic computing networks, in Foundation of Computer Science (iv), editors J. W. de Bakker and J. Van Leeuwen, 1983"},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"Pingali, Arvind, Efficient Demand Driving Evaluation, ACM, TOPLAS vol 7(2), 1986","DOI":"10.1145\/3318.3480"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"Pratt, V., Modeling Concurrency with Partial Orders, International Journal of Parallel Programming, Vol. 15, No. 1, 1986.","DOI":"10.1007\/BF01379149"},{"key":"24_CR18","volume-title":"Communication with Automata","author":"C. A. Petri","year":"1966","unstructured":"C. A. Petri, Communication with Automata, TR-65-377, Applied Data Research, Princeton, 1966."},{"key":"24_CR19","unstructured":"Rabinovich, A., Pomset Semantics is Consistent with Data Flow Semantics, Bulletin of EATCS 32, 1987."},{"key":"24_CR20","doi-asserted-by":"crossref","unstructured":"Rabinovich, A., Trakhtenbrot, B. A., Behavior Structure and Nets, in Fundamenta Informatica 11(4), 1988.","DOI":"10.3233\/FI-1988-11404"},{"key":"24_CR21","doi-asserted-by":"crossref","unstructured":"Rabinovich, A., Trakhtenbrot, B. A., Nets of Processes and Data Flow, in Proceedings of Rex Workshop on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency 1988, LNCS vol. 354","DOI":"10.1007\/BFb0013036"},{"key":"24_CR22","unstructured":"Rabinovich, A., Trakhtenbrot, B. A., Nets and Data Flow Interpreters, in the Proceedings of the Fourth Symposium on Logic in Computer Science 1989."},{"key":"24_CR23","unstructured":"Rabinovich, A., Trakhtenbrot, B. A., Communication among Relations (Preliminary Draft), Technical Report 151\/89 Tel Aviv Un."},{"key":"24_CR24","doi-asserted-by":"crossref","unstructured":"B. A. Trakhtenbrot, Understanding Nets, in MFCS 1989, LNCS 379.","DOI":"10.1007\/3-540-51486-4_60"},{"key":"24_CR25","doi-asserted-by":"crossref","unstructured":"J. Staples, V. Nguyen, A Fixed Point Semantics for Nondeterministic Data Flow, Journal of the ACM 32, 1985.","DOI":"10.1145\/3149.3155"},{"key":"24_CR26","unstructured":"Ullman, J. D., Principles of Data Base and Knowledge Base Systems, Computer Science Press 1988."},{"key":"24_CR27","unstructured":"Wadge, W. Ashcroft, E., LUCID, the Data Flow Programming Language, Academic Press, 1985"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0032040","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T12:07:00Z","timestamp":1736165220000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032040"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540528261"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/bfb0032040","relation":{},"subject":[]}}