{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T11:40:34Z","timestamp":1784720434302,"version":"3.55.0"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2017,4,27]],"date-time":"2017-04-27T00:00:00Z","timestamp":1493251200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"funder":[{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"crossref","award":["320571"],"award-info":[{"award-number":["320571"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>We use modal logic as a framework for coalgebraic trace semantics, and show\nthe flexibility of the approach with concrete examples such as the language\nsemantics of weighted, alternating and tree automata, and the trace semantics\nof generative probabilistic systems. We provide a sufficient condition under\nwhich a logical semantics coincides with the trace semantics obtained via a\ngiven determinization construction. Finally, we consider a condition that\nguarantees the existence of a canonical determinization procedure that is\ncorrect with respect to a given logical semantics. That procedure is closely\nrelated to Brzozowski's minimization algorithm.<\/jats:p>","DOI":"10.2168\/lmcs-12(4:10)2016","type":"journal-article","created":{"date-parts":[[2017,8,10]],"date-time":"2017-08-10T10:07:20Z","timestamp":1502359640000},"source":"Crossref","is-referenced-by-count":7,"title":["Coalgebraic trace semantics via forgetful logics"],"prefix":"10.46298","volume":"Volume 12, Issue 4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5793-7425","authenticated-orcid":false,"given":"Bartek","family":"Klin","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":[[2017,4,27]]},"reference":[{"key":"1227:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/2622\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/2622\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T20:12:20Z","timestamp":1681243940000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/2622"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,27]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-12(4:10)2016","relation":{"is-same-as":[{"id-type":"arxiv","id":"1611.05183","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1611.05183","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4,27]]},"article-number":"2622"}}