{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T22:45:10Z","timestamp":1648853110115},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":5676,"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":[[1998,1]]},"DOI":"10.1016\/s0304-3975(97)00085-6","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"87-112","source":"Crossref","is-referenced-by-count":4,"title":["Open maps, behavioural equivalences, and congruences 1"],"prefix":"10.1016","volume":"190","author":[{"given":"Allan","family":"Cheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mogens","family":"Nielsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00085-6_BIB1","series-title":"Category and Computer Science","first-page":"357","article-title":"A final coalgebra theorem","volume":"vol. 389","author":"Aczel","year":"1989"},{"key":"10.1016\/S0304-3975(97)00085-6_BIB2","series-title":"Conf. Record of the 15th Ann. ACM Symp. on Principles of Programming Languages","first-page":"229","article-title":"Bisimulation can't be Traced","author":"Bloom","year":"1988"},{"key":"10.1016\/S0304-3975(97)00085-6_BIB3","doi-asserted-by":"crossref","DOI":"10.7146\/brics.v3i35.20017","article-title":"Presheaf models for concurrency","author":"Cattani","year":"1996","journal-title":"Tech. Report, BRICS"},{"key":"10.1016\/S0304-3975(97)00085-6_BIB4","series-title":"Proc. LICS'93, 8th Ann. Symp. on Logic in Computer Science","first-page":"110","article-title":"A coinduction principle for recursive data types based on bisimulation","author":"Fiore","year":"1993"},{"key":"10.1016\/S0304-3975(97)00085-6_BIB5","article-title":"Algebraic Theory of Processes","author":"Hennessy","year":"1988"},{"key":"10.1016\/S0304-3975(97)00085-6_BIB6","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0168-0072(94)90069-8","article-title":"A completeness theorem for open maps","volume":"70","author":"Joyal","year":"1994","journal-title":"Arm. Pure App. Logic"},{"key":"10.1016\/S0304-3975(97)00085-6_BIB7","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1006\/inco.1996.0057","article-title":"Bisimulation and open maps","volume":"127","author":"Joyal","year":"1996","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(97)00085-6_BIB8","series-title":"Graduate Texts in Mathematics","article-title":"Categories for the working mathematician","author":"MacLane","year":"1971"},{"key":"10.1016\/S0304-3975(97)00085-6_BIB9","article-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/S0304-3975(97)00085-6_BIB10","series-title":"Proc. FST&TCS 15, 15th Conf. on the Foundations of Software Technology & Theoretical Computer Science","first-page":"263","article-title":"Observe behaviour categorically","volume":"vol. 1026","author":"Nielsen","year":"1995"},{"key":"10.1016\/S0304-3975(97)00085-6_BIB11","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0304-3975(94)90014-0","article-title":"A co-induction principle for recursively defined domains","volume":"124","author":"Pitts","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00085-6_BIB12","article-title":"A structural approach to operational semantics","author":"Plotkin","year":"1981"},{"key":"10.1016\/S0304-3975(97)00085-6_BIB13","series-title":"Proc. REX Workshop A Decade of Concurrency \u2014 Reflections and Perspectives","first-page":"229","article-title":"Initial algebra and final coalgebra semantics for concurrency","volume":"vol. 803","author":"Rutten","year":"1994"},{"key":"10.1016\/S0304-3975(97)00085-6_BIB14","article-title":"Finite Representations of CCS and TCSP Programs by Automata and Petri Nets","volume":"vol. 369","author":"Taubner","year":"1989"},{"key":"10.1016\/S0304-3975(97)00085-6_BIB15","series-title":"Models for Concurrency","first-page":"1","volume":"vol. 4","author":"Winskel","year":"1995"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597000856?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597000856?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T21:58:28Z","timestamp":1556315908000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597000856"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["S0304397597000856"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00085-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}