{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:57Z","timestamp":1761611157607,"version":"build-2065373602"},"reference-count":10,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":5323,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1999]]},"DOI":"10.1016\/s1571-0661(05)80269-5","type":"journal-article","created":{"date-parts":[[2005,5,25]],"date-time":"2005-05-25T08:37:08Z","timestamp":1117010228000},"page":"61-80","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["A coalgebraic introduction to CSP"],"prefix":"10.1016","volume":"19","author":[{"given":"Uwe","family":"Wolter","sequence":"first","affiliation":[]}],"member":"78","reference":[{"year":"1974","series-title":"Universal Theory of Automata","author":"Ehrig","key":"10.1016\/S1571-0661(05)80269-5_BIB1"},{"year":"1988","series-title":"Algebraic Theory of Processes","author":"Hennessy","key":"10.1016\/S1571-0661(05)80269-5_BIB2"},{"year":"1985","series-title":"Communicating Sequential Processes","author":"Hoare","key":"10.1016\/S1571-0661(05)80269-5_BIB3"},{"key":"10.1016\/S1571-0661(05)80269-5_BIB4","series-title":"Recent Trends in Data Type Specification","first-page":"49","article-title":"Unification of Theories: A Challenge for Computing Science","author":"Hoare","year":"1996"},{"key":"10.1016\/S1571-0661(05)80269-5_BIB5","first-page":"222","article-title":"A tutorial on (co)algebras and (co)induction","volume":"62","author":"Jacobs","year":"1997","journal-title":"Bulletin of EATCS"},{"year":"1989","series-title":"Communication and Concurrency","key":"10.1016\/S1571-0661(05)80269-5_BIB6"},{"key":"10.1016\/S1571-0661(05)80269-5_BIB7","unstructured":"J.J.M.M. Rutten. Universal coalgebra: a theory of systems. Technical Report CS-R9652, CWI, 1996."},{"key":"10.1016\/S1571-0661(05)80269-5_BIB8","doi-asserted-by":"crossref","unstructured":"J.J.M.M. Rutten. Automata and coinduction (an exersice in coalgebra). Technical Report SEN-R9803, CWI, 1998.","DOI":"10.1007\/BFb0055624"},{"key":"10.1016\/S1571-0661(05)80269-5_BIB9","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 Journ. Comput"},{"key":"10.1016\/S1571-0661(05)80269-5_BIB10","doi-asserted-by":"crossref","unstructured":"G. Winskel and M. Nielsen. Models for concurrency. Technical Report DAIMI PB 463, Aarhus University, 1993. to appear as a chapter in the Handbook of Logic in Computer Science.","DOI":"10.7146\/dpb.v22i463.6936"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105802695?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105802695?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:07:51Z","timestamp":1761610071000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105802695"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"references-count":10,"alternative-id":["S1571066105802695"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80269-5","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A coalgebraic introduction to CSP","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)80269-5","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1999 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}