{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T04:43:16Z","timestamp":1648615396963},"reference-count":7,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,5,1]],"date-time":"2000-05-01T00:00:00Z","timestamp":957139200000},"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":4825,"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":[[2000,5]]},"DOI":"10.1016\/s0304-3975(99)00084-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:38:29Z","timestamp":1027651109000},"page":"465-475","source":"Crossref","is-referenced-by-count":7,"title":["Weak confluence and \u03c4-inertness"],"prefix":"10.1016","volume":"238","author":[{"given":"Mingsheng","family":"Ying","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00084-5_BIB1","series-title":"Finite Transition Systems","author":"Arnold","year":"1994"},{"key":"10.1016\/S0304-3975(99)00084-5_BIB2","doi-asserted-by":"crossref","unstructured":"J.F. Groote, M.P.A. Sellink, Confluence for process verification, Theoret. Comput. Sci. 170 (1996) 47\u201381. For a more detailed version, see: Confluence for process verification, Tech. Report 137, Logic Group Preprint Series, Utrecht University, June 1995.","DOI":"10.1016\/S0304-3975(96)00175-2"},{"key":"10.1016\/S0304-3975(99)00084-5_BIB3","doi-asserted-by":"crossref","unstructured":"R. Milner, A Calculus of Communicating Systems, Lecture Notes in Computer Science, vol. 92, Springer, Berlin, 1980.","DOI":"10.1007\/3-540-10235-3"},{"key":"10.1016\/S0304-3975(99)00084-5_BIB4","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/S0304-3975(99)00084-5_BIB5","unstructured":"R. Milner, Errata to [3], private communication, 1990."},{"key":"10.1016\/S0304-3975(99)00084-5_BIB6","first-page":"278","article-title":"The linear time-branching time spectrum","volume":"vol. 458","author":"van Glabbeek","year":"1990"},{"key":"10.1016\/S0304-3975(99)00084-5_BIB7","unstructured":"G. Winskel, M. Nielsen, Models for concurrency, in: S. Abramsky, D.M. Gabby, T.S.E. Maibaum (Eds.), Handbook of Logic in Computer Science, vol. 4: Semantic Modelling, Oxford, Clarendon Press, 1995, pp. 1\u2013139."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599000845?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599000845?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T10:53:25Z","timestamp":1555239205000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599000845"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,5]]},"references-count":7,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,5]]}},"alternative-id":["S0304397599000845"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00084-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,5]]}}}