{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:06:16Z","timestamp":1767927976360,"version":"3.49.0"},"publisher-location":"Berlin\/Heidelberg","reference-count":10,"publisher":"Springer-Verlag","isbn-type":[{"value":"3540528261","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0032072","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T01:05:31Z","timestamp":1134263131000},"page":"752-764","source":"Crossref","is-referenced-by-count":30,"title":["The importance of the left merge operator in process algebras"],"prefix":"10.1007","author":[{"given":"Faron","family":"Moller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"56_CR1","doi-asserted-by":"crossref","unstructured":"J.A. Bergstra, J.W. Klop, \u201cProcess Algebra for Synchronous Communication\u201d, Information and Computation, Vol 60, No 1\/3, 1984.","DOI":"10.1016\/S0019-9958(84)80025-X"},{"key":"56_CR2","doi-asserted-by":"crossref","unstructured":"J.A. Bergstra, J.W. Klop, \u201cAlgebra of Communicating Processes with Abstraction\u201d, Theoretical Computer Science, Vol 37, No 1, 1985.","DOI":"10.1016\/0304-3975(85)90088-X"},{"key":"56_CR3","doi-asserted-by":"crossref","unstructured":"G. Boudol, I. Castellani, \u201cOn the Semantics of Concurrency: Partial Orders and Transition Systems\u201d, Proc. TAPSOFT '87, Vol I, LNCS 249, Springer-Verlag, 1987.","DOI":"10.1007\/3-540-17660-8_52"},{"key":"56_CR4","unstructured":"M. Hennessy, \u201cAxiomatising Finite Concurrent Processes\u201d, University of Sussex Computer Science Department Report No 4\/87, July 1987."},{"key":"56_CR5","doi-asserted-by":"crossref","unstructured":"R. Milner, A Calculus of Communicating Systems, LNCS 92, Springer-Verlag, 1980.","DOI":"10.1007\/3-540-10235-3"},{"key":"56_CR6","unstructured":"R. Milner, Communication and Concurrency, Prentice-Hall International, 1989."},{"key":"56_CR7","unstructured":"R. Milner, F. Moller, \u201cUnique Decomposition of Processes\u201d, Bulletin of the EATCS, 1990 (to appear)."},{"key":"56_CR8","unstructured":"F. Moller, \u201cAxioms for Concurrency\u201d, Ph.D. Thesis, University of Edinburgh, Report No ECS-LFCS-89-84, 1989."},{"key":"56_CR9","doi-asserted-by":"crossref","unstructured":"F. Moller, \u201cThe Nonexistence of Finite Axiomatisations for CCS Congruences\u201d, Proceedings LICS90, 1990.","DOI":"10.1109\/LICS.1990.113741"},{"key":"56_CR10","doi-asserted-by":"crossref","unstructured":"D.M.R. Park, \u201cConcurrency and Automata on Infinite Sequences\u201d, Proceedings of the 5 th G.I. Conference, Lecture Notes in Computer Science 104, Springer-Verlag, 1981.","DOI":"10.1007\/BFb0017309"}],"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\/BFb0032072","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T09:44:57Z","timestamp":1586598297000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032072"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540528261"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/bfb0032072","relation":{},"subject":[]}}