{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:15:16Z","timestamp":1725664516248},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602187"},{"type":"electronic","value":"9783540447382"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60218-6_38","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:51:49Z","timestamp":1330278709000},"page":"501-515","source":"Crossref","is-referenced-by-count":1,"title":["Delayed choice for process algebra with abstraction"],"prefix":"10.1007","author":[{"given":"P. R.","family":"D'Argenio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Mauw","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"issue":"1","key":"38_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1994.1040","volume":"111","author":"L. Aceto","year":"1994","unstructured":"L. Aceto, B. Bloom, and F.W. Vaandrager. Turning SOS rules into equations. Information and Computation, 111(1):1\u201352, 1994.","journal-title":"Information and Computation"},{"issue":"2","key":"38_CR2","first-page":"127","volume":"IX","author":"J.C.M. Baeten","year":"1986","unstructured":"J.C.M. Baeten, J.A. Bergstra, and J.W. Klop. Syntax and defining equations for an interrupt mechanism in process algebra. Fund. Inf., IX(2):127\u2013168, 1986.","journal-title":"Fund. Inf."},{"key":"38_CR3","doi-asserted-by":"crossref","unstructured":"J.C.M. Baeten and S. Mauw. Delayed choice: an operator for joining Message Sequence Charts. In D. Hogrefe and S. Leue, editors, Formal Description Techniques, VII, pages 340\u2013354. Chapman & Hall, 1995.","DOI":"10.1007\/978-0-387-34878-0_27"},{"key":"38_CR4","first-page":"149","volume-title":"Handbook of logic in computer science (Vol 4, Semantic modelling)","author":"J.C.M. Baeten","year":"1995","unstructured":"J.C.M. Baeten and C. Verhoef. Concrete process algebra, pages 149\u2013268. Handbook of logic in computer science (Vol 4, Semantic modelling), eds. S. Abramsky, Dov. M. Gabbay and T.S.E. Maibaum. Clarendon press, Oxford, 1995."},{"key":"38_CR5","doi-asserted-by":"crossref","unstructured":"J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge Tracts in Theoretical Computer Science 18. Cambridge University Press, 1990.","DOI":"10.1017\/CBO9780511624193"},{"key":"38_CR6","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0019-9958(84)80025-X","volume":"60","author":"J.A. Bergstra","year":"1984","unstructured":"J.A. Bergstra and J.W. Klop. Process algebra for synchronous communication. Information & Control, 60:109\u2013137, 1984.","journal-title":"Information & Control"},{"key":"38_CR7","doi-asserted-by":"crossref","unstructured":"B. Bloom, S. Istrail, and A.R. Meyer. Bisimulation can't be traced: preliminary report. In Proc. 15th ACM symposium on Principles of Programming Languages, pages 229\u2013239. San Diego, California, 1988.","DOI":"10.1145\/73560.73580"},{"issue":"3","key":"38_CR8","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"S.D. Brookes","year":"1984","unstructured":"S.D. Brookes, C.A.R. Hoare, and A.W. Roscoe. A theory of communicating sequential processes. Journal of the ACM, 31(3):560\u2013599, 1984.","journal-title":"Journal of the ACM"},{"key":"38_CR9","unstructured":"P. D'Argenio. \u03c4-angelic choice for process algebra. Technical report, LIFIA, Dpto. de Inform\u00e0tica, Fac. Cs. Exactas, UNLP, 1994."},{"key":"38_CR10","doi-asserted-by":"crossref","unstructured":"P. D'Argenio and S. Mauw. Delayed choice for process algebra with abstraction. Report, Department of Computer Science, Eindhoven University of Technology, 1995. To appear.","DOI":"10.1007\/3-540-60218-6_38"},{"key":"38_CR11","unstructured":"R.J. van Glabbeek and W.P. Weijland. Branching time and abstraction in bisimulation semantics (extended abstract). In G.X. Ritter, editor, Information Processing 89, pages 613\u2013618. North-Holland, 1989."},{"key":"38_CR12","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/0890-5401(92)90013-6","volume":"100","author":"J.F. Groote","year":"1992","unstructured":"J.F. Groote and F.W. Vaandrager. Structured operational semantics and bisimulation as a congruence. Information and Computation, 100:202\u2013260, 1992.","journal-title":"Information and Computation"},{"key":"38_CR13","unstructured":"S. Kamin and J.-J. L\u00e9vy. Two generalizations of the recursive path ordering. Unpublished manuscript, 1980."},{"key":"38_CR14","unstructured":"J.W. Klop. Term rewriting systems. In S. Abramsky, D. Gabbay, and T. Maibaum, editors, Handbook of Logic in Computer Science, volume II, pages 1\u2013116. Oxford University Press, 1992."},{"key":"38_CR15","unstructured":"C.P.J. Koymans and J.L.M. Vrancken. Extending process algebra with the empty process. Report LGPS 1, Dept. of Philosophy, University of Utrecht, 1985."},{"key":"38_CR16","doi-asserted-by":"crossref","unstructured":"D.M.R. Park. Concurrency and automata on infinite sequence. In P. Deussen, editor, Proc. 5th. GI Conference, pages 167\u2013183. LNCS 104, Springer-Verlag, 1981.","DOI":"10.1007\/BFb0017309"},{"key":"38_CR17","unstructured":"G.D. Plotkin. A structural approach to operational semantics. Report DAIMI-FN-19, Computer Science Department, University of \u00c5rhus, 1981."},{"key":"38_CR18","first-page":"433","volume-title":"LNCS 836","author":"C. Verhoef","year":"1994","unstructured":"C. Verhoef. A congruence theorem for structured operational semantics with predicates and negative premises. In B. Jonsson and J. Parrow, editors, Proc. CONCUR '94, pages 433\u2013448. Uppsala, Springer Verlag, 1994. LNCS 836."},{"key":"38_CR19","first-page":"149","volume-title":"Proc. PROCOMET'94, IFIP 2 Working Conference","author":"C. Verhoef","year":"1994","unstructured":"C. Verhoef. A general conservative extension theorem in process algebra. In E.-R. Olderog, editor, Proc. PROCOMET'94, IFIP 2 Working Conference, pages 149\u2013168. San Miniato, North-Holland, 1994."}],"container-title":["Lecture Notes in Computer Science","CONCUR '95: Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60218-6_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:56:03Z","timestamp":1605646563000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60218-6_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602187","9783540447382"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-60218-6_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}