{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:51Z","timestamp":1761611151365},"reference-count":28,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[1994,5,1]],"date-time":"1994-05-01T00:00:00Z","timestamp":767750400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Form. Asp. Comput."],"published-print":{"date-parts":[[1994,5]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>We illustrate the difference between sequential composition in process algebra axiomatisations like ACP and action prefixing in process calculi like CCS. We define both early and late input in a general framework extending ACP, and consider various subalgebras, some very close to value passing CCS, another one close to CSP.<\/jats:p>","DOI":"10.1007\/bf01215407","type":"journal-article","created":{"date-parts":[[2005,2,25]],"date-time":"2005-02-25T15:22:43Z","timestamp":1109344963000},"page":"250-268","source":"Crossref","is-referenced-by-count":11,"title":["On sequential composition, action prefixes and process prefix"],"prefix":"10.1145","volume":"6","author":[{"given":"J. C. M.","family":"Baeten","sequence":"first","affiliation":[{"name":"Department of Mathematics and Computer Science, Eindhoven University of Technology, PO Box 513, 5600, MB Eindhoven, The Netherlands"}]},{"given":"J. A.","family":"Bergstra","sequence":"additional","affiliation":[{"name":"Programming Research Group, University of Amsterdam, Amsterdam, The Netherlands"},{"name":"Department of Philosophy, Utrecht University, Utrecht, The Netherlands"}]}],"member":"320","reference":[{"key":"e_1_2_1_2_1_2","doi-asserted-by":"crossref","unstructured":"Baeten J.C.M.: Applications of process algebra Cambridge Tracts in TCS 17 Cambridge University Press 1990.","DOI":"10.1017\/CBO9780511608841"},{"key":"e_1_2_1_2_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(88)90027-2"},{"key":"e_1_2_1_2_3_2","first-page":"83","volume-title":"Proc. CONCUR 90","author":"Baeten J.C.M.","year":"1990"},{"key":"e_1_2_1_2_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-77572-7_13"},{"key":"e_1_2_1_2_5_2","doi-asserted-by":"crossref","unstructured":"Baeten J.C.M. and Weijland W.P.: Process algebra Cambridge Tracts in TCS 18 Cambridge University Press 1990.","DOI":"10.1017\/CBO9780511624193"},{"issue":"2","key":"e_1_2_1_2_6_2","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/S0019-9958(82)91250-5","article-title":"Processes and the denotational semantics of concurrency","volume":"54","author":"de Bakker J.W.","year":"1982","journal-title":"Inf. & Control"},{"key":"e_1_2_1_2_7_2","volume-title":"report IW 206","author":"Bergstra J.A.","year":"1982"},{"key":"e_1_2_1_2_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(84)80025-X"},{"key":"e_1_2_1_2_9_2","doi-asserted-by":"crossref","unstructured":"Bergstra J.A. and Klop J.W.: Verification of an alternating bit protocol by means of process algebra in: Math. Methods of Spec. and Synthesis of Software Systems '85 (W: Bibel & K.P. Jantke eds.) Springer LNCS 215 1986 pp. 9\u201323.","DOI":"10.1007\/3-540-16444-8_1"},{"key":"e_1_2_1_2_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(85)90010-3"},{"key":"e_1_2_1_2_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(87)90123-X"},{"key":"e_1_2_1_2_12_2","unstructured":"Brinksma H.: On the design of extended LOTOS \u2014 a specification language for open distributed systems Ph.D. Thesis University of Twente 1988."},{"key":"e_1_2_1_2_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/828.833"},{"key":"e_1_2_1_2_14_2","doi-asserted-by":"crossref","unstructured":"Engberg U. and Nielsen M.: A calculus of communicating systems with label passing report DAIMA PB-208 Aarhus University 1986.","DOI":"10.7146\/dpb.v15i208.7559"},{"key":"e_1_2_1_2_15_2","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/3-540-54430-5_92","volume-title":"Proc. CONCUR'91","author":"Groote J.F.","year":"1991"},{"key":"e_1_2_1_2_16_2","doi-asserted-by":"crossref","unstructured":"Hennessy M. and Ingolfsdottir M.: A theory of communicating processes with value-passing I&C 1991.","DOI":"10.1007\/BF01642508"},{"key":"e_1_2_1_2_17_2","doi-asserted-by":"crossref","unstructured":"Hennessy M. and Lin H.: Proof systems for message-passing process algebras report 5\/93 University of Sussex 1993.","DOI":"10.1007\/3-540-57208-2_15"},{"key":"e_1_2_1_2_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/359576.359585"},{"key":"e_1_2_1_2_19_2","doi-asserted-by":"crossref","unstructured":"Hoare C.A.R.: Communicating sequential processes Prentice Hall 1985.","DOI":"10.1007\/978-3-642-82921-5_4"},{"key":"e_1_2_1_2_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/27651.27653"},{"key":"e_1_2_1_2_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/988071.988075"},{"key":"e_1_2_1_2_22_2","doi-asserted-by":"crossref","unstructured":"Milner R.: A calculus for communicating systems Springer LNCS 92 1980.","DOI":"10.1007\/3-540-10235-3"},{"key":"e_1_2_1_2_23_2","unstructured":"Milner R.: Communication and concurrency Prentice-Hall 1989."},{"key":"e_1_2_1_2_24_2","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/3-540-54430-5_80","volume-title":"Proc. CONCUR'91","author":"Milner R.","year":"1991"},{"key":"e_1_2_1_2_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(92)90008-4"},{"key":"e_1_2_1_2_26_2","doi-asserted-by":"crossref","unstructured":"Park D.M.R.: Concurrency and automata on infinite sequences in: Proc. 5th GI Conf. (P. Deussen ed.) Springer LNCS 104 1981 pp. 167\u2013183.","DOI":"10.1007\/BFb0017309"},{"key":"e_1_2_1_2_27_2","unstructured":"Vaandrager F.W.: Algebraic techniques for concurrency and their application Ph.D. Thesis University of Amsterdam 1990."},{"key":"e_1_2_1_2_28_2","unstructured":"Verhoef C.: Linear unary operators in process algebra Ph.D. Thesis University of Amsterdam 1992."}],"container-title":["Formal Aspects of Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01215407.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01215407\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1007\/BF01215407","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T15:21:27Z","timestamp":1641482487000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1007\/BF01215407"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,5]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,5]]}},"alternative-id":["10.1007\/BF01215407"],"URL":"https:\/\/doi.org\/10.1007\/bf01215407","relation":{},"ISSN":["0934-5043","1433-299X"],"issn-type":[{"value":"0934-5043","type":"print"},{"value":"1433-299X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,5]]}}}