{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T20:12:51Z","timestamp":1774987971108,"version":"3.50.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,5,1]],"date-time":"1989-05-01T00:00:00Z","timestamp":609984000000},"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":8843,"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":[[1989,5]]},"DOI":"10.1016\/0890-5401(89)90070-9","type":"journal-article","created":{"date-parts":[[2004,12,2]],"date-time":"2004-12-02T00:24:20Z","timestamp":1101947060000},"page":"227-247","source":"Crossref","is-referenced-by-count":103,"title":["A complete axiomatisation for observational congruence of finite-state behaviours"],"prefix":"10.1016","volume":"81","author":[{"given":"Robin","family":"Milner","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(89)90070-9_BIB1","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0304-3975(87)90052-1","article-title":"On the consistency of Koomen's fair abstraction rule","volume":"51","author":"Baeten","year":"1987","journal-title":"J. Theor. Comput. Sci."},{"key":"10.1016\/0890-5401(89)90070-9_BIB2","first-page":"560","article-title":"A theory of communicating sequential processes","volume":"31","author":"Brookes","year":"1984"},{"key":"10.1016\/0890-5401(89)90070-9_BIB3","series-title":"Proceedings, Logic Colloquium '86","first-page":"21","article-title":"A complete inference system for regular processes with silent moves","author":"Bergstra","year":"1988"},{"key":"10.1016\/0890-5401(89)90070-9_BIB4","doi-asserted-by":"crossref","first-page":"896","DOI":"10.1145\/4221.4249","article-title":"Acceptance trees","volume":"32","author":"Hennessy","year":"1985","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(89)90070-9_BIB5","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(89)90070-9_BIB6","first-page":"261","article-title":"A term model for CCS","volume":"Vol. 88","author":"Hennessy","year":"1980"},{"issue":"No. 7","key":"10.1016\/0890-5401(89)90070-9_BIB7","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1145\/360248.360251","article-title":"Formal verification of parallel programs","volume":"19","author":"Keller","year":"1976","journal-title":"Comm. ACM"},{"key":"10.1016\/0890-5401(89)90070-9_BIB8","article-title":"A Calculus for Communicating Systems","volume":"Vol. 92","author":"Milner","year":"1980"},{"key":"10.1016\/0890-5401(89)90070-9_BIB9","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 behaviours","volume":"28","author":"Milner","year":"1984","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0890-5401(89)90070-9_BIB10","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":"J. Theor. Comput. Sci."},{"key":"10.1016\/0890-5401(89)90070-9_BIB11","series-title":"Control Flow and Data Flow: Concepts of Distributed Programming, Proceedings, NATO International Summer School of Marktoberdorf in 1984","article-title":"Lectures on a calculus for communicating systems","author":"Milner","year":"1986"},{"key":"10.1016\/0890-5401(89)90070-9_BIB12","series-title":"Proceedings, 5th Gl Conference","first-page":"167","article-title":"Concurrency and automata on infinite sequences","volume":"Vol. 104","author":"Park","year":"1981"},{"key":"10.1016\/0890-5401(89)90070-9_BIB13","series-title":"Proceedings 2nd Conference on Logics in Computer Science","article-title":"Bisimulation and divergence","author":"Walker","year":"1988"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540189900709?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540189900709?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T18:27:09Z","timestamp":1549045629000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0890540189900709"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,5]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,5]]}},"alternative-id":["0890540189900709"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(89)90070-9","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1989,5]]}}}