{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:28Z","timestamp":1761611068920,"version":"build-2065373602"},"reference-count":18,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1997,5,1]],"date-time":"1997-05-01T00:00:00Z","timestamp":862444800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1997,5,1]],"date-time":"1997-05-01T00:00:00Z","timestamp":862444800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[1999,5,19]],"date-time":"1999-05-19T00:00:00Z","timestamp":927072000000},"content-version":"vor","delay-in-days":748,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1997,5]]},"DOI":"10.1016\/s0304-3975(96)00251-4","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T19:53:40Z","timestamp":1051127620000},"page":"329-349","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":18,"title":["Notes on the methodology of CCS and CSP"],"prefix":"10.1016","volume":"177","author":[{"given":"R.J.","family":"van Glabbeek","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"6","key":"10.1016\/S0304-3975(96)00251-4_BIB1","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1093\/comjnl\/30.6.498","article-title":"Ready trace semantics for concrete process algebra with priority operator","volume":"30","author":"Baeten","year":"1987","journal-title":"Computer Journal"},{"key":"10.1016\/S0304-3975(96)00251-4_BIB2","first-page":"127","article-title":"Syntax and defining equations for an interrupt mechanism in process algebra","volume":"IX","author":"Baeten","year":"1986","journal-title":"Fund. Inform."},{"key":"10.1016\/S0304-3975(96)00251-4_BIB3","series-title":"Proc. of the CWI Symp. Math. and Comp. Sci.","first-page":"89","article-title":"Algebra of communicating processes","author":"Bergstra","year":"1986"},{"key":"10.1016\/S0304-3975(96)00251-4_BIB4","series-title":"Proc. IFIP Working Conf. on the Formal Description of Programming Concepts","first-page":"77","article-title":"Failures without chaos: a new process semantics for fair abstraction","author":"Bergstra","year":"1987"},{"key":"10.1016\/S0304-3975(96)00251-4_BIB5","series-title":"Proc. 10th ICALP","first-page":"83","article-title":"On the relationship of CCS and CSP","volume":"Vol. 154","author":"Brookes","year":"1983"},{"issue":"3","key":"10.1016\/S0304-3975(96)00251-4_BIB6","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/828.833","article-title":"A theory of communicating sequential processes","volume":"31","author":"Brookes","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(96)00251-4_BIB7","series-title":"Proc. 14th ACM Symp. on Theory of Computing","first-page":"153","article-title":"Denotational semantics of concurrency","author":"de Bakker","year":"1982"},{"issue":"1\/2","key":"10.1016\/S0304-3975(96)00251-4_BIB8","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","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(96)00251-4_BIB9","series-title":"Found of Comp. Theory","first-page":"115","article-title":"A complete set of axioms for a theory of communicating sequential processes","volume":"Vol. 158","author":"De Nicola","year":"1983"},{"year":"1985","series-title":"Communicating Sequential Processes","author":"Hoare","key":"10.1016\/S0304-3975(96)00251-4_BIB10"},{"key":"10.1016\/S0304-3975(96)00251-4_BIB11","series-title":"Automata Studies","first-page":"3","article-title":"Representation of events in nerve nets and finite automata","author":"Kleene","year":"1956"},{"key":"10.1016\/S0304-3975(96)00251-4_BIB12","article-title":"A Calculus for Communicating Systems","volume":"Vol. 92","author":"Milner","year":"1980"},{"key":"10.1016\/S0304-3975(96)00251-4_BIB13","series-title":"Seminar on Concurrency","article-title":"Lectures on a Calculus for Communicating Systems","volume":"Vol. 197","author":"Milner","year":"1985"},{"key":"10.1016\/S0304-3975(96)00251-4_BIB14","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF00268075","article-title":"Specification-oriented semantics for communicating processes","volume":"23","author":"Olderog","year":"1986","journal-title":"Acta Informatica"},{"key":"10.1016\/S0304-3975(96)00251-4_BIB15","series-title":"Proc 5th GI Conf.","article-title":"Concurrency and automata on infinite sequences","volume":"Vol. 104","author":"Park","year":"1981"},{"year":"1982","series-title":"Petrinetze","author":"Reisig","key":"10.1016\/S0304-3975(96)00251-4_BIB16"},{"key":"10.1016\/S0304-3975(96)00251-4_BIB17","series-title":"Proc. 4th Advanced Course on Found. Comp. Sci.","article-title":"Partially ordered computations, with applications to VLSI design","author":"Rem","year":"1983"},{"issue":"1","key":"10.1016\/S0304-3975(96)00251-4_BIB18","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1145\/321312.321326","article-title":"Two complete axiom systems for the algebra of regular events","volume":"13","author":"Salomaa","year":"1966","journal-title":"J. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002514?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596002514?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:45:16Z","timestamp":1759625116000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397596002514"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,5]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,5]]}},"alternative-id":["S0304397596002514"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00251-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1997,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Notes on the methodology of CCS and CSP","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(96)00251-4","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1997 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}