{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T11:41:02Z","timestamp":1784720462244,"version":"3.55.0"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2021,12,15]],"date-time":"2021-12-15T00:00:00Z","timestamp":1639526400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"crossref","award":["795119"],"award-info":[{"award-number":["795119"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>The classical Hennessy-Milner theorem says that two states of an image-finite\ntransition system are bisimilar if and only if they satisfy the same formulas\nin a certain modal logic. In this paper we study this type of result in a\ngeneral context, moving from transition systems to coalgebras and from\nbisimilarity to coinductive predicates. We formulate when a logic fully\ncharacterises a coinductive predicate on coalgebras, by providing suitable\nnotions of adequacy and expressivity, and give sufficient conditions on the\nsemantics. The approach is illustrated with logics characterising similarity,\ndivergence and a behavioural metric on automata.<\/jats:p>","DOI":"10.46298\/lmcs-17(4:19)2021","type":"journal-article","created":{"date-parts":[[2021,12,15]],"date-time":"2021-12-15T20:25:48Z","timestamp":1639599948000},"source":"Crossref","is-referenced-by-count":5,"title":["Expressive Logics for Coinductive Predicates"],"prefix":"10.46298","volume":"Volume 17, Issue 4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0502-391X","authenticated-orcid":false,"given":"Clemens","family":"Kupke","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jurriaan","family":"Rot","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"25203","published-online":{"date-parts":[[2021,12,15]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/8854\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/8854\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T20:17:55Z","timestamp":1687292275000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/6593"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,15]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-17(4:19)2021","relation":{"has-preprint":[{"id-type":"arxiv","id":"2006.12465v2","asserted-by":"subject"},{"id-type":"arxiv","id":"2006.12465v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2006.12465","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2006.12465","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,12,15]]},"article-number":"6593"}}