{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T19:58:26Z","timestamp":1693857506066},"reference-count":6,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1987,1,1]],"date-time":"1987-01-01T00:00:00Z","timestamp":536457600000},"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":9694,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1987]]},"DOI":"10.1016\/0304-3975(87)90073-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"335-343","source":"Crossref","is-referenced-by-count":5,"title":["An intensional characterization of the largest bisimulation"],"prefix":"10.1016","volume":"53","author":[{"given":"Lars","family":"Halln\u00e4s","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(87)90073-9_BIB1","author":"Aczel","year":"1986","journal-title":"On largest fixed points of set continuous class operators"},{"key":"10.1016\/0304-3975(87)90073-9_BIB2","series-title":"Approximations and descriptions of non-wellfounded sets","author":"Halln\u00e4s","year":"1985"},{"key":"10.1016\/0304-3975(87)90073-9_BIB3","article-title":"A Calculus of Communicating Systems","volume":"92","author":"Milner","year":"1980"},{"key":"10.1016\/0304-3975(87)90073-9_BIB4","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":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(87)90073-9_BIB5","series-title":"Proc. 5th Gl Conf.","article-title":"Concurrency and automata on infinite sequences","volume":"104","author":"Park","year":"1981"},{"key":"10.1016\/0304-3975(87)90073-9_BIB6","doi-asserted-by":"crossref","DOI":"10.2140\/pjm.1955.5.285","article-title":"A lattice-theoretical fixpoint theorem and its applications","volume":"5","author":"Tarski","year":"1955","journal-title":"Pac. J. Math."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397587900739?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397587900739?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:52:40Z","timestamp":1555127560000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397587900739"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"references-count":6,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1987]]}},"alternative-id":["0304397587900739"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(87)90073-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1987]]}}}