{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:23:10Z","timestamp":1725456190458},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540510802"},{"type":"electronic","value":"9783540461470"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/bfb0013036","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T01:06:46Z","timestamp":1132708006000},"page":"574-602","source":"Crossref","is-referenced-by-count":13,"title":["Nets of processes and data flow"],"prefix":"10.1007","author":[{"given":"A.","family":"Rabinovich","sequence":"first","affiliation":[]},{"given":"B. A.","family":"Trakhtenbrot","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"17_CR1","first-page":"252","volume":"107","author":"J.D Brock","year":"1981","unstructured":"Brock, J.D and Ackerman, W.B, Scenarios: A Model of Non-Deterministic Computations, In Formalization of Programming Concepts, LNCS 107, 1981, 252\u2013259.","journal-title":"LNCS"},{"key":"17_CR2","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":"17_CR3","unstructured":"Gaifman, H., Pratt, V.R., Partial Order Models of Concurrency and the Computation of Functions, LICS 1987."},{"key":"17_CR4","unstructured":"Kahn, G., The Semantics for a Simple Language for Parallel Programming, IFIP 74."},{"key":"17_CR5","unstructured":"Kahn, G., Plotkin, G., Structure de donnes concretes. IRIA-LABORIA Report 336 1978"},{"key":"17_CR6","unstructured":"Lynch, N., Stark, E., A Proof of the Kahn Principle for Input\/Output Automata Report Mit\/LCS\/TM-349 1988"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Milner, R., Calculi for Synchrony and Asynchrony, Theoretical Computer Science 25, 1983.","DOI":"10.1016\/0304-3975(83)90114-7"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Pratt, V., Modeling Concurrency with Partial Order, International Journal of Parallel Programming, Vol. 15, 1986","DOI":"10.1007\/BF01379149"},{"key":"17_CR9","unstructured":"Rabinovich, A., Pomset Semantics is Consistent with Data Flow Semantics, Bulletin of EATCS vol. 32, 1987."},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Rabinovich, A., Trakhtenbrot, B. A., Behaviour Structures and Nets, to appear in Fundamenta Informatica 1988","DOI":"10.3233\/FI-1988-11404"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Trakhtenbrot, B. A., Recursive Program Schemes and Computable Functionals, LNCS, vol. 45, 1976.","DOI":"10.1007\/3-540-07854-1_168"},{"key":"17_CR12","unstructured":"Trakhtenbrot, B. A., Rabinovich, A., Hirshfeld, J., Nets of Processes, Technical Report 97\/88 Institute of Computer Science, Tel Aviv University."}],"container-title":["Lecture Notes in Computer Science","Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0013036","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,20]],"date-time":"2021-07-20T03:11:43Z","timestamp":1626750703000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0013036"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540510802","9783540461470"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0013036","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}