{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T03:25:09Z","timestamp":1778037909587,"version":"3.51.4"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2007,11,19]],"date-time":"2007-11-19T00:00:00Z","timestamp":1195430400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/assumed-1991-2003"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Trace semantics has been defined for various kinds of state-based systems,\nnotably with different forms of branching such as non-determinism vs.\nprobability. In this paper we claim to identify one underlying mathematical\nstructure behind these \"trace semantics,\" namely coinduction in a Kleisli\ncategory. This claim is based on our technical result that, under a suitably\norder-enriched setting, a final coalgebra in a Kleisli category is given by an\ninitial algebra in the category Sets. Formerly the theory of coalgebras has\nbeen employed mostly in Sets where coinduction yields a finer process semantics\nof bisimilarity. Therefore this paper extends the application field of\ncoalgebras, providing a new instance of the principle \"process semantics via\ncoinduction.\"<\/jats:p>","DOI":"10.2168\/lmcs-3(4:11)2007","type":"journal-article","created":{"date-parts":[[2008,6,3]],"date-time":"2008-06-03T13:14:49Z","timestamp":1212498889000},"source":"Crossref","is-referenced-by-count":71,"title":["Generic Trace Semantics via Coinduction"],"prefix":"10.46298","volume":"Volume 3, Issue 4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8300-4650","authenticated-orcid":false,"given":"Ichiro","family":"Hasuo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bart","family":"Jacobs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8384-3438","authenticated-orcid":false,"given":"Ana","family":"Sokolova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2007,11,19]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/864\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/864\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T19:58:04Z","timestamp":1681243084000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/864"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11,19]]},"references-count":0,"URL":"https:\/\/doi.org\/10.2168\/lmcs-3(4:11)2007","relation":{"is-same-as":[{"id-type":"arxiv","id":"0710.2505","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.0710.2505","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,11,19]]},"article-number":"864"}}