{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:23:17Z","timestamp":1725517397716},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540857617"},{"type":"electronic","value":"9783540857624"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85762-4_5","type":"book-chapter","created":{"date-parts":[[2008,8,22]],"date-time":"2008-08-22T14:20:29Z","timestamp":1219414829000},"page":"66-80","source":"Crossref","is-referenced-by-count":0,"title":["Non-interleaving Semantics with Causality for Nondeterministic Dataflow"],"prefix":"10.1007","author":[{"given":"Oana","family":"Agrigoroaiei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabriel","family":"Ciobanu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0040252","volume-title":"Mathematical Foundations of Programming Semantics","author":"S. Abramsky","year":"1990","unstructured":"Abramsky, S.: A Generalized Kahn Principle for Abstract Asynchronous Networks. In: Schmidt, D.A., Main, M.G., Melton, A.C., Mislove, M.W. (eds.) MFPS 1989. LNCS, vol.\u00a0442, pp. 1\u201321. Springer, Heidelberg (1990)"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Jung, A.: Domain Theory. In: Handbook of Logic in Computer Science, vol.\u00a0III, pp. 1\u2013168. Clarendon Press (1994)","DOI":"10.1093\/oso\/9780198537625.003.0001"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/3-540-10699-5_102","volume-title":"Scenarios: A Model of Non-Determinate Computation","author":"J. Brock","year":"1981","unstructured":"Brock, J., Ackerman, W.: Formalization of Programming Concepts. LNCS, vol.\u00a0107, pp. 252\u2013259. Springer, Heidelberg (1981)"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","first-page":"103","volume-title":"The Design of an Extendible Graph Editor","author":"M. Ern\u00e9","year":"1993","unstructured":"Ern\u00e9, M., Koslowski, J., Melton, A., Strecker, G.E.: A Primer on Galois Connections. In: Paulisch, F.N. (ed.) The Design of an Extendible Graph Editor. LNCS, vol.\u00a0704, pp. 103\u2013125. Springer, Heidelberg (1993)"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1017\/S0960129504004293","volume":"14","author":"T.T. Hildebrandt","year":"2004","unstructured":"Hildebrandt, T.T., Panangaden, P., Winskel, G.: A Relational Model of Non-Deterministic Dataflow. Mathematical Structures in Computer Science\u00a014, 613\u2013649 (2004)","journal-title":"Mathematical Structures in Computer Science"},{"key":"5_CR6","unstructured":"Gaifman, H., Pratt, V.R.: Partial Order Models of Concurrency and the Computation of Functions. Logic in Computer Science, 72\u201385 (1987)"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Jonsson, B.: A Fully Abstract Trace Model for Dataflow Networks. Principles of Programming Languages, 155\u2013165 (1989)","DOI":"10.1145\/75277.75291"},{"key":"5_CR8","unstructured":"Kahn, G.: The Semantics of a Simple Language for Parallel Programming. In: IFIP Congress, pp. 471\u2013475 (1974)"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"1907","DOI":"10.1016\/S0167-8191(99)00070-8","volume":"25","author":"W.A. Najjar","year":"1999","unstructured":"Najjar, W.A., Lee, E.A., Gao, G.R.: Advances in the Dataflow Computational Model. Parallel Computing\u00a025, 1907\u20131929 (1999)","journal-title":"Parallel Computing"},{"key":"5_CR10","first-page":"85","volume":"13","author":"M. Nielson","year":"1981","unstructured":"Nielson, M., Plotkin, G.D., Winskel, G.: Petri Nets, Event Structures and Domains. Rechnerstrukturen und Betriebsprogrammierung\u00a013, 85\u2013108 (1981)","journal-title":"Rechnerstrukturen und Betriebsprogrammierung"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Russell, J.R.: Full Abstraction for Nondeterministic Dataflow Networks. Foundations of Computer Science, 170\u2013175 (1989)","DOI":"10.1109\/SFCS.1989.63474"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.entcs.2006.10.055","volume":"175","author":"L. Saunders-Evans","year":"2007","unstructured":"Saunders-Evans, L., Winskel, G.: Event Structure Spans for Nondeterministic Dataflow. Electronic Notes of Theoretical Computer Science\u00a0175, 109\u2013129 (2007)","journal-title":"Electronic Notes of Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing - ICTAC 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85762-4_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,29]],"date-time":"2024-02-29T12:30:26Z","timestamp":1709209826000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85762-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540857617","9783540857624"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85762-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}