{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:47Z","timestamp":1761611207066},"reference-count":36,"publisher":"Informa UK Limited","issue":"1-2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Computer Mathematics"],"published-print":{"date-parts":[[1997,1]]},"DOI":"10.1080\/00207169708804599","type":"journal-article","created":{"date-parts":[[2007,6,26]],"date-time":"2007-06-26T00:21:54Z","timestamp":1182817314000},"page":"57-88","source":"Crossref","is-referenced-by-count":8,"title":["Network algebra for asynchronous dataflow<sup>\u2217<\/sup>"],"prefix":"10.1080","volume":"65","author":[{"given":"J.A.","family":"Bergstra","sequence":"first","affiliation":[]},{"given":"C.A.","family":"Middelburg","sequence":"additional","affiliation":[]},{"given":"G.H.","family":"\u015etef[acaron]nescu","sequence":"additional","affiliation":[]}],"member":"301","reference":[{"key":"CIT0001","volume-title":"Network algebra for synchronous and asynchronous dataflow","author":"Bergstra J.A.","year":"1995"},{"key":"CIT0002","doi-asserted-by":"crossref","first-page":"171","DOI":"10.3233\/FI-1990-13204","volume":"13","author":"C[acaron]z[acaron]nescu V.E.","year":"1990","journal-title":"Fundamenta Informaticae"},{"key":"CIT0003","first-page":"471","volume-title":"Information Processing","volume":"74","author":"Kahn G.","year":"1974"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(88)90016-0"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1007\/BF02280834"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(84)80025-X"},{"key":"CIT0007","volume-title":"Algebraic specification of synchronous concurrent algorithms and architecture","author":"Thompson B.C.","year":"1991"},{"key":"CIT0008","volume-title":"Computable processes","author":"Barendregt H.","year":"1994"},{"key":"CIT0009","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/3-540-10699-5_102","volume-title":"Formalisation of Programming Concepts","volume":"107","author":"Brock J.D.","year":"1981"},{"key":"CIT0010","doi-asserted-by":"crossref","DOI":"10.1109\/SFCS.1989.63474","volume-title":"Full abstraction for nondeterministic dataflow networks","author":"Russell J.","year":"1989"},{"key":"CIT0011","first-page":"73","volume":"35","author":"\u015etef[acaron]nescu Gh.","year":"1990","journal-title":"Revue Roumaine de Mathematiques Pures et Applique"},{"key":"CIT0012","volume-title":"Centre for Mathematics and Computer Science","author":"B\u00f6hm A.P.W.","year":"1984"},{"key":"CIT0013","doi-asserted-by":"crossref","unstructured":"Kok, J. 1987.A fully abstract semantics for data flow nets, Edited by: de Bakker, J.W., Nijman, A.J. and Treleaven, P.C. Vol. LNCS 259, 351\u2013368. Springer-Verlag. PARLE'87","DOI":"10.1007\/3-540-17945-3_20"},{"key":"CIT0014","unstructured":"Van Glabbeek, R.J., Weijland, W.P. and Ritter, G.X. 1989.Information Processing 89, 613\u2013618. CWI: North-Holland. Full version: Report CS-9120"},{"key":"CIT0015","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511624193","volume-title":"Process Algebra","volume":"18","author":"Baeten J.C.M.","year":"1990"},{"key":"CIT0016","first-page":"205","volume":"78","author":"Baeten J.C.M.","year":"1988","journal-title":"Information and Control"},{"key":"CIT0017","series-title":"F88","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/978-3-642-77572-7_13","volume-title":"Programming and Mathematical Methods","author":"Baeten J.C.M.","year":"1992"},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/37.4.243"},{"key":"CIT0019","doi-asserted-by":"publisher","DOI":"10.1007\/BF01215407"},{"key":"CIT0020","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(87)90114-9"},{"key":"CIT0021","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-60249-6_38","volume-title":"Fundamentals of Computation Theory","volume":"965","author":"Baeten J.C.M.","year":"1995"},{"key":"CIT0022","volume-title":"Part 1: Binary flownomials, basic theory","author":"\u015etef[acaron]nescu G.H.","year":"1994"},{"key":"CIT0023","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90006-F"},{"key":"CIT0024","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/978-1-4471-2120-6_3","volume-title":"Algebra of Communicating Processes 1994","author":"Groote J.F.","year":"1995"},{"key":"CIT0025","doi-asserted-by":"crossref","unstructured":"Korver, H. and Springintveld, J. 1994.A computer- checked verification of Milner's scheduler, Edited by: Hagiya, M. and Mitchell, J. 161\u2013178. Springer-Verlag. TACS'94, LNCS 789","DOI":"10.1007\/3-540-57887-0_95"},{"key":"CIT0026","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/978-1-4471-3229-5_13","volume-title":"Semantics of Specification Language","author":"Groote J.F.","year":"1994"},{"key":"CIT0027","first-page":"53","volume-title":"Formal Description of Programming Concepts III","author":"Baeten J.C.M.","year":"1987"},{"key":"CIT0028","volume-title":"The Coq proof assistant user's guide, version 5.8","author":"Dowek G.","year":"1993"},{"key":"CIT0029","first-page":"337","volume-title":"Formal Description of Programming Concepts","author":"Keller R.M.","year":"1978"},{"key":"CIT0030","first-page":"77","volume-title":"Formal Description ofProgramming Concepts III","author":"Bergstra J.A.","year":"1987"},{"key":"CIT0031","doi-asserted-by":"crossref","unstructured":"Van Glabbeek, R.J. 1987.Bounded nondetermmism and the approximation induction principle in process algebra, Edited by: Brandenburg, F.J., Vidal-Naquet, G. and Wirsing, M. 336\u2013347. Springer-Verlag. STACS 87, LNCS 247","DOI":"10.1007\/BFb0039617"},{"key":"CIT0032","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90088-X"},{"key":"CIT0033","doi-asserted-by":"crossref","unstructured":"Bezem, M.A. and Groote, J.F. 1994.Invariants in process algebra with data, Edited by: Jonsson, B. and Parrow, J. 401\u2013416. Springer-Verlag. CONCUR\u203294, LNCS 836","DOI":"10.1007\/978-3-540-48654-1_30"},{"key":"CIT0034","volume-title":"Focus points and convergent process operators","author":"Groote J. F.","year":"1995"},{"key":"CIT0035","doi-asserted-by":"publisher","DOI":"10.1145\/151299.151302"},{"key":"CIT0036","volume-title":"Fairness Properties in Process Algebra with Applications in Communication Protocol Verification","author":"Parrow J.","year":"1985"}],"container-title":["International Journal of Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207169708804599","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,16]],"date-time":"2021-08-16T02:55:26Z","timestamp":1629082526000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/00207169708804599"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,1]]},"references-count":36,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,1]]}},"alternative-id":["10.1080\/00207169708804599"],"URL":"https:\/\/doi.org\/10.1080\/00207169708804599","relation":{},"ISSN":["0020-7160","1029-0265"],"issn-type":[{"value":"0020-7160","type":"print"},{"value":"1029-0265","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,1]]}}}