{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:36:42Z","timestamp":1725457002858},"publisher-location":"Berlin\/Heidelberg","reference-count":14,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540528261"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0032057","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T06:05:31Z","timestamp":1134281131000},"page":"540-552","source":"Crossref","is-referenced-by-count":1,"title":["Structural and behavioural equivalences of networks"],"prefix":"10.1007","author":[{"given":"Joachim","family":"Parrow","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"41_CR1","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0304-3975(84)90067-7","volume":"30","author":"D Austry","year":"1984","unstructured":"D Austry and G Boudol. Alg\u00e8bre de processus et synchronisation. Theoretical Computer Science, 30(1):91\u2013131, 1984.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"41_CR2","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"S. Brookes","year":"1984","unstructured":"S. Brookes, C.A.R. Hoare, and W. Roscoe. A theory of communicating sequential processes. J. ACM, 31(3):560\u2013599, 1984.","journal-title":"J. ACM"},{"issue":"2","key":"41_CR3","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0167-6423(85)90010-3","volume":"5","author":"J. Bergstra","year":"1985","unstructured":"J. Bergstra and J. Tucker. Top-down design and the algebra of communicating processes. Science of Computer Programming, 5(2):171\u2013199, 1985.","journal-title":"Science of Computer Programming"},{"key":"41_CR4","doi-asserted-by":"crossref","unstructured":"Bengt Jonsson. A model and proof system for asynchronous networks. In Proceedings of the 4:th ACM Symposium on Principles of Distributed Computing, pages 49\u201358, 1985.","DOI":"10.1145\/323596.323601"},{"key":"41_CR5","unstructured":"G Kahn. The semantics of a simple language for parallel programming. In IFIP 74, pages 471\u2013475, 1974."},{"key":"41_CR6","doi-asserted-by":"crossref","unstructured":"R M Keller and P Panangaden. Semantics of networks containing indeterminate operators. In Brookes, Roscoe, and Winskel, editors, Seminar on Concurrency 1984, LNCS 197, pages 479\u2013496, 1985.","DOI":"10.1007\/3-540-15670-4_23"},{"issue":"4","key":"41_CR7","doi-asserted-by":"crossref","first-page":"794","DOI":"10.1145\/322154.322167","volume":"26","author":"R. Milner","year":"1979","unstructured":"Robin Milner. Flowgraphs and flow algebras. J. ACM, 26(4):794\u2013818, 1979.","journal-title":"J. ACM"},{"key":"41_CR8","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","volume":"25","author":"R. Milner","year":"1983","unstructured":"Robin Milner. Calculi for synchrony and asynchrony. Theoretical Computer Science, 25:267\u2013310, 1983.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"41_CR9","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1145\/3318.3322","volume":"7","author":"G. Milne","year":"1985","unstructured":"George Milne. CIRCAL and the representation of communication, concurrency and time. ACM Transactions on Programming Languages and Systems, 7(2):270\u2013298, 1985.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"41_CR10","unstructured":"Robin Milner. Communication and Concurrency. Prentice Hall, 1989."},{"key":"41_CR11","unstructured":"David Park. The \u2018fairness\u2019 problem and nondeterministic computing networks. In de Bakker and van Leeuwen, editors, Foundations of Computer Science IV. Part 2, pages 133\u2013161. Amsterdam, 1983. Mathematical Centre Tracts 159."},{"key":"41_CR12","unstructured":"Joachim Parrow. Synchronisation flow algebra. Technical Report LFCS-87-35, Laboratory for Foundations of Computer Science, Department of Computer Science, University of Edinburgh, 1987."},{"key":"41_CR13","doi-asserted-by":"crossref","unstructured":"Joachim Parrow. The expressive power of simple parallelism. In Proceedings of PARLE '89, Vol. II; LNCS 366, pages 389\u2013405, 1989.","DOI":"10.1007\/3-540-51285-3_54"},{"issue":"2","key":"41_CR14","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1145\/3149.3155","volume":"32","author":"J Staples","year":"1985","unstructured":"J Staples and V L Nguyen. A fixpoint semantics for nondeterministic data flow. J. ACM, 32(2):411\u2013444, 1985.","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0032057.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T22:05:36Z","timestamp":1607551536000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032057"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540528261"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0032057","relation":{},"subject":[]}}