{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:38Z","timestamp":1761611138787},"reference-count":22,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3954,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s1571-0661(04)80368-2","type":"journal-article","created":{"date-parts":[[2004,9,28]],"date-time":"2004-09-28T19:29:25Z","timestamp":1096399765000},"page":"270-285","source":"Crossref","is-referenced-by-count":6,"title":["A Syntactical Approach to Weak (Bi-)Simulation for Coalgebras"],"prefix":"10.1016","volume":"65","author":[{"given":"Jan","family":"Rothe","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80368-2_NEWBIB1","doi-asserted-by":"crossref","unstructured":"R. Goldblatt. A calculus of terms for coalgebras of polynomial functors. In A. Corradini, M. Lenisa, and U. Montanari, editors, Coalgebraic Methods in Computer Science, volume 44 of ENTCS, pages 160\u2013183, April 2001.","DOI":"10.1016\/S1571-0661(04)80907-1"},{"key":"10.1016\/S1571-0661(04)80368-2_NEWBIB2","first-page":"159","article-title":"Birkhoffs variety theorem for coalgebras","volume":"13","author":"Gumm","year":"2000","journal-title":"Contributions to General Algebra"},{"issue":"1","key":"10.1016\/S1571-0661(04)80368-2_NEWBIB3","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/2455.2460","article-title":"Algebraic laws for nondeterminism and concurrency","volume":"32","author":"Hennessy","year":"1985","journal-title":"Journal of the ACM"},{"key":"10.1016\/S1571-0661(04)80368-2_NEWBIB4","unstructured":"B. Jacobs. The temporal logic of coalgebras via galois algebras. Technical Report CSI-R9906, Computing Science Institute, University of Nijmegen, 1999. To appear in Mathematical Structures in Computer Science."},{"key":"10.1016\/S1571-0661(04)80368-2_NEWBIB5","first-page":"222","article-title":"A tutorial on (co)algebras and (co)induction","volume":"62","author":"Jacobs","year":"1997","journal-title":"EATCS Bulletin"},{"key":"10.1016\/S1571-0661(04)80368-2_NEWBIB6","unstructured":"A. Kurz. A co-variety-theorem for modal logic. In Proceedings of Advances in Modal Logic, Uppsala. CSLI, Stanford, 1998. Revised Version."},{"key":"10.1016\/S1571-0661(04)80368-2_NEWBIB7","doi-asserted-by":"crossref","unstructured":"A. Kurz. Specifying coalgebras with modal logic. In B. Jacobs, L. Moss, H. Reichel, and J. Rutten, editors, Proceedings of CMCS, volume 11 of ENTCS, Lisbon, March 1998.","DOI":"10.1016\/S1571-0661(04)00053-2"},{"key":"10.1016\/S1571-0661(04)80368-2_NEWBIB8","doi-asserted-by":"crossref","unstructured":"D. Ma\u0161ulovi\u0107. Towards coalgebraic behaviourism. In L. Moss, editor, Proceedings of CMCS, volume 65.1 of ENTCS, 2002.","DOI":"10.1016\/S1571-0661(04)80365-7"},{"key":"10.1016\/S1571-0661(04)80368-2_NEWBIB9","series-title":"Communicating and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/S1571-0661(04)80368-2_NEWBIB10","doi-asserted-by":"crossref","unstructured":"D. Pattinson. Semantical principles in the modal logic of coalgebras. Technical report, Institut Informatik, LMU M\u00fcnchen, 2000.","DOI":"10.1007\/3-540-44693-1_45"},{"key":"10.1016\/S1571-0661(04)80368-2_NEWBIB11","doi-asserted-by":"crossref","unstructured":"D. Pattinson. Semantical principles in the modal logic of coalgebras. In A. Ferreira and H. Reichel, editors, Proceedings of STACS, volume 2010 of LNCS. Springer, 2001.","DOI":"10.1007\/3-540-44693-1_45"},{"key":"10.1016\/S1571-0661(04)80368-2_NEWBIB12","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1017\/S0960129500000694","article-title":"An approach to object semantics based on terminal coalgebras","volume":"5","author":"Reichel","year":"1995","journal-title":"Mathematical Structures in Computer Science"},{"key":"10.1016\/S1571-0661(04)80368-2_NEWBIB13","first-page":"55","article-title":"Languages for coalgebras on datafunctors","volume":"19","author":"R\u00f6\u00dfiger","year":"1999","journal-title":"ENTCS"},{"key":"10.1016\/S1571-0661(04)80368-2_NEWBIB14","doi-asserted-by":"crossref","unstructured":"M. R\u00f6\u00dfiger. Coalgebras, Clone Theory and Modal Logic. PhD thesis, Univ. of Dresden, Germany, 2000.","DOI":"10.1016\/S1571-0661(05)80353-6"},{"key":"10.1016\/S1571-0661(04)80368-2_NEWBIB15","unstructured":"J. Rothe. Modal logics for coalgebraic class specification. Master's thesis, Inst. Theor. Informatik, TU Dresden, D-01062 Dresden, Germany, 2000."},{"key":"10.1016\/S1571-0661(04)80368-2_NEWBIB16","doi-asserted-by":"crossref","unstructured":"J. Rothe and D. Ma\u0161ulovi\u0107. Towards weak bisimulation for coalgebras. In A. Kurz, editor, Proceedings of CMCIM, volume 68.1 of ENTCS, 2002. Submitted.","DOI":"10.1016\/S1571-0661(04)80499-7"},{"issue":"2","key":"10.1016\/S1571-0661(04)80368-2_NEWBIB17","first-page":"175","article-title":"The coalgebraic class specification language","volume":"7","author":"Rothe","year":"2001","journal-title":"CCSL. Journal of Universal Computer Science (JUCS)"},{"key":"10.1016\/S1571-0661(04)80368-2_NEWBIB18","unstructured":"J. Rutten. Universal coalgebra: a theory of systems. Report CS-R9652, Centrum voor Wiskunde en Informatica, CWI, P.O. Box 94079, 1090GB Amsterdam, The Netherlands, 1996."},{"key":"10.1016\/S1571-0661(04)80368-2_NEWBIB19","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1051\/ita:1999125","article-title":"A note on coinduction and weak bisimilarity for while programs","volume":"33","author":"Rutten","year":"1999","journal-title":"Theoretical Informatics and Applications"},{"key":"10.1016\/S1571-0661(04)80368-2_NEWBIB20","unstructured":"H. Tews. Coalgebraic Specification and Verification. PhD thesis, Dresden University of Technology, 2002. Forthcomming."},{"key":"10.1016\/S1571-0661(04)80368-2_NEWBIB21","doi-asserted-by":"crossref","unstructured":"R.J. van Glabbeek. Bounded nondeterminism and the approximation induction principle in process algebra. In F.J. Brandenburg, G. Vidal-Naquet, and M. Wirsing, editors, Proceedings of STACS 1987, number 247 in LNCS, pages 336\u2013347. Springer, 1987. Extended Abstract.","DOI":"10.1007\/BFb0039617"},{"key":"10.1016\/S1571-0661(04)80368-2_NEWBIB22","series-title":"Handbook of Logic in Computer Science","first-page":"1","article-title":"Models for concurrency","author":"Winskel","year":"1995"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104803682?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104803682?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T06:51:55Z","timestamp":1585896715000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104803682"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S1571066104803682"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80368-2","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}