{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T17:59:51Z","timestamp":1649008791753},"reference-count":14,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"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":4095,"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":[[2002,5]]},"DOI":"10.1016\/s0304-3975(01)00019-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:07:16Z","timestamp":1027652836000},"page":"3-34","source":"Crossref","is-referenced-by-count":6,"title":["CSP, partial automata, and coalgebras"],"prefix":"10.1016","volume":"280","author":[{"given":"Uwe","family":"Wolter","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00019-6_BIB1","series-title":"Universal Theory of Automata","author":"Ehrig","year":"1974"},{"key":"10.1016\/S0304-3975(01)00019-6_BIB2","unstructured":"J. Goguen, G. Malcom, A hidden agenda, Tech. Report CS97-538, UCSD, Dept. Computer Science & Eng., May 1997, Theoret. Comput. Sci., to appear."},{"key":"10.1016\/S0304-3975(01)00019-6_BIB3","series-title":"Algebraic Theory of Processes","author":"Hennessy","year":"1988"},{"key":"10.1016\/S0304-3975(01)00019-6_BIB4","series-title":"Communicating Sequential Processes","author":"Hoare","year":"1985"},{"key":"10.1016\/S0304-3975(01)00019-6_BIB5","doi-asserted-by":"crossref","unstructured":"C.A.R. Hoare, Unification of theories: a challenge for computing science, in: M. Haveraaen, O. Owe, O.-J. Dahl (Eds.), Recent Trends in Data Type Specification, 11th Workshop on Specification of Abstract Data Types, WADT11, Oslo Norway, September 1995, Lecture Notes in Computer Science, Vol. 1130, Springer, Berlin, 1996, pp. 49\u201357.","DOI":"10.1007\/3-540-61629-2_35"},{"key":"10.1016\/S0304-3975(01)00019-6_BIB6","first-page":"222","article-title":"A tutorial on (co)algebras and (co)induction","volume":"62","author":"Jacobs","year":"1997","journal-title":"Bull. of EATCS"},{"key":"10.1016\/S0304-3975(01)00019-6_BIB7","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/S0304-3975(01)00019-6_BIB8","series-title":"Initial Computability, Algebraic Specifications, and Partial Algebras","author":"Reichel","year":"1987"},{"key":"10.1016\/S0304-3975(01)00019-6_BIB9","unstructured":"J.J.M.M. Rutten, Universal coalgebra: a theory of systems, Tech. Report CS-R9652, CWI, 1996."},{"key":"10.1016\/S0304-3975(01)00019-6_BIB10","doi-asserted-by":"crossref","unstructured":"J.J.M.M. Rutten, Automata and coinduction (an exercise in coalgebra), Tech. Report SEN-R9803, CWI, 1998. Available at URL: www.cwi.nl. Also in the Proc. CONCUR \u201998, Lecture Notes in Computer Science, Vol. 1466, Springer, Berlin, 1998, pp. 194\u2013218.","DOI":"10.1007\/BFb0055624"},{"key":"10.1016\/S0304-3975(01)00019-6_BIB11","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1137\/0211062","article-title":"The category theoretic solution of recursive domain equations","volume":"11","author":"Smyth","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(01)00019-6_BIB12","unstructured":"D. Turi, Functorial operational semantics and its denotational dual, Ph.D. Thesis, Free Univ. Amsterdam, 1996."},{"key":"10.1016\/S0304-3975(01)00019-6_BIB13","first-page":"1","article-title":"Models for concurrency","volume":"Vol. 4","author":"Winskel","year":"1995"},{"key":"10.1016\/S0304-3975(01)00019-6_BIB14","doi-asserted-by":"crossref","unstructured":"U. Wolter, A coalgebraic introduction to CSP. in: B. Jacobs, J. Rutten (Eds.), Proc. 2nd Workshop on Coalgebraic Methods in Computer Science (CMCS\u201999), Amsterdam, The Netherlands. Electronic Notes of TCS, Vol. 19, Elsevier Science, 1999, Amsterdam, URL: http: \/\/www.elsevier.nl\/locate\/entcs\/.","DOI":"10.1016\/S1571-0661(05)80269-5"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501000196?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501000196?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T22:25:53Z","timestamp":1555194353000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501000196"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["S0304397501000196"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00019-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,5]]}}}