{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,27]],"date-time":"2026-08-27T01:09:30Z","timestamp":1787792970936,"version":"build-2784847793"},"reference-count":24,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,5,1]],"date-time":"1990-05-01T00:00:00Z","timestamp":641520000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8478,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1990,5]]},"DOI":"10.1016\/0890-5401(90)90025-d","type":"journal-article","created":{"date-parts":[[2004,12,16]],"date-time":"2004-12-16T20:34:26Z","timestamp":1103229266000},"page":"43-68","source":"Crossref","is-referenced-by-count":344,"title":["CCS expressions, finite state processes, and three problems of equivalence"],"prefix":"10.1016","volume":"86","author":[{"given":"Paris C.","family":"Kanellakis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Scott A.","family":"Smolka","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(90)90025-D_BIB1","author":"Aho","year":"1974"},{"issue":"No. 1","key":"10.1016\/0890-5401(90)90025-D_BIB2","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/0890-5401(88)90017-X","article-title":"Bisimulation of automata","volume":"79","author":"Benson","year":"1988","journal-title":"Inform. and Comput."},{"key":"10.1016\/0890-5401(90)90025-D_BIB3","series-title":"CWI Monographs I, Proceedings of the CWI Symposium on Mathematics and Computer Science","first-page":"89","article-title":"Algebra of communicating processes","author":"Bergstra","year":"1986"},{"key":"10.1016\/0890-5401(90)90025-D_BIB4","author":"Bergstra","year":"1987"},{"key":"10.1016\/0890-5401(90)90025-D_BIB5","series-title":"Proceedings, 10th International Conference on Automata, Languages, and Programming","first-page":"83","article-title":"On the relationship of CCS and CSP","volume":"Vol. 154","author":"Brookes","year":"1983"},{"issue":"No. 3","key":"10.1016\/0890-5401(90)90025-D_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. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(90)90025-D_BIB7","series-title":"Proceedings, 10th International Conference on Automata, Languages, and Programming","first-page":"97","article-title":"Behavioural equivalence relationships induced by programming logics","volume":"Vol. 154","author":"Brookes","year":"1983"},{"key":"10.1016\/0890-5401(90)90025-D_BIB24","unstructured":"Chandra, A. K., and Stockmeyer, L. J. (1982), Private communication."},{"key":"10.1016\/0890-5401(90)90025-D_BIB8","series-title":"Proceedings, 19th ACM Symposium on Theory of Computing","first-page":"1","article-title":"Matrix multiplication via arithmetic progressions","author":"Coppersmith","year":"1987"},{"issue":"No. 4","key":"10.1016\/0890-5401(90)90025-D_BIB9","doi-asserted-by":"crossref","first-page":"896","DOI":"10.1145\/4221.4249","article-title":"Acceptance trees","volume":"34","author":"Hennessy","year":"1985","journal-title":"J. Assoc. Comput. Mach."},{"issue":"No. 1","key":"10.1016\/0890-5401(90)90025-D_BIB10","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/2455.2460","article-title":"Algebraic laws for nondeterminism and concurrency","volume":"32","author":"Hennessy","year":"1985","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(90)90025-D_BIB11","series-title":"Theory of Machines and Computations","first-page":"189","article-title":"An nlogn algorithm for minimizing states in a finite automaton","author":"Hopcroft","year":"1971"},{"key":"10.1016\/0890-5401(90)90025-D_BIB12","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0890-5401(90)90025-D_BIB13","series-title":"Proceedings, 2nd Annual ACM Symposium on Principles of Distributed Computing","first-page":"228","article-title":"CCS expressions, finite state processes, and three problems of equivalence","author":"Kanellakis","year":"1983"},{"key":"10.1016\/0890-5401(90)90025-D_BIB14","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF01762125","article-title":"On the analysis of cooperation and antagonism in networks of communicating processes","volume":"3","author":"Kanellakis","year":"1988","journal-title":"Algorithmica"},{"key":"10.1016\/0890-5401(90)90025-D_BIB15","article-title":"A calculus of communicating systems","volume":"Vol. 92","author":"Milner","year":"1980"},{"key":"10.1016\/0890-5401(90)90025-D_BIB16","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","article-title":"Calculi for synchrony and asynchrony","volume":"25","author":"Milner","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(90)90025-D_BIB17","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/0022-0000(84)90023-0","article-title":"A complete inference system for a class of regular behaviors","volume":"28","author":"Milner","year":"1984","journal-title":"J. Comput. System Sci."},{"issue":"No. 1","key":"10.1016\/0890-5401(90)90025-D_BIB18","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","article-title":"Testing equivalences for processes","volume":"34","author":"de Nicola","year":"1984","journal-title":"Theoret. Comput. Sci."},{"issue":"No. 6","key":"10.1016\/0890-5401(90)90025-D_BIB19","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1137\/0216062","article-title":"Three partition refinement algorithms","volume":"16","author":"Paige","year":"1987","journal-title":"SIAM J. Comput."},{"issue":"No. 1","key":"10.1016\/0890-5401(90)90025-D_BIB20","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":"1986","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(90)90025-D_BIB21","author":"Sanderson","year":"1982"},{"key":"10.1016\/0890-5401(90)90025-D_BIB22","article-title":"Analysis of Communicating Finite-State Processes","author":"Smolka","year":"1984"},{"key":"10.1016\/0890-5401(90)90025-D_BIB23","series-title":"Proceedings, 5th ACM Symposium on Theory of Computing","first-page":"1","article-title":"Word problems requiring exponential time","author":"Stockmeyer","year":"1973"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019090025D?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019090025D?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T01:25:57Z","timestamp":1548897957000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/089054019090025D"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,5]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,5]]}},"alternative-id":["089054019090025D"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(90)90025-d","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1990,5]]}}}