{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:59:20Z","timestamp":1762459160908,"version":"3.41.2"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2013,3,4]],"date-time":"2013-03-04T00:00:00Z","timestamp":1362355200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"funder":[{"name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia, I.P.","award":["PTDC\/EIA-CCO\/122240\/2010"],"award-info":[{"award-number":["PTDC\/EIA-CCO\/122240\/2010"]}]},{"DOI":"10.13039\/501100003246","name":"Netherlands Organisation for Scientific Research","doi-asserted-by":"crossref","award":["5755"],"award-info":[{"award-number":["5755"]}],"id":[{"id":"10.13039\/501100003246","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia, I.P.","award":["SFRH\/BPD\/71956\/2010"],"award-info":[{"award-number":["SFRH\/BPD\/71956\/2010"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>The powerset construction is a standard method for converting a\nnondeterministic automaton into a deterministic one recognizing the same\nlanguage. In this paper, we lift the powerset construction from automata to the\nmore general framework of coalgebras with structured state spaces. Coalgebra is\nan abstract framework for the uniform study of different kinds of dynamical\nsystems. An endofunctor F determines both the type of systems (F-coalgebras)\nand a notion of behavioural equivalence (~_F) amongst them. Many types of\ntransition systems and their equivalences can be captured by a functor F. For\nexample, for deterministic automata the derived equivalence is language\nequivalence, while for non-deterministic automata it is ordinary bisimilarity.\nWe give several examples of applications of our generalized determinization\nconstruction, including partial Mealy machines, (structured) Moore automata,\nRabin probabilistic automata, and, somewhat surprisingly, even pushdown\nautomata. To further witness the generality of the approach we show how to\ncharacterize coalgebraically several equivalences which have been object of\ninterest in the concurrency community, such as failure or ready semantics.<\/jats:p>","DOI":"10.2168\/lmcs-9(1:9)2013","type":"journal-article","created":{"date-parts":[[2013,11,29]],"date-time":"2013-11-29T13:36:16Z","timestamp":1385732176000},"source":"Crossref","is-referenced-by-count":35,"title":["Generalizing determinization from automata to coalgebras"],"prefix":"10.46298","volume":"Volume 9, Issue 1","author":[{"given":"Alexandra","family":"Silva","sequence":"first","affiliation":[]},{"given":"Filippo","family":"Bonchi","sequence":"additional","affiliation":[]},{"given":"Marcello","family":"Bonsangue","sequence":"additional","affiliation":[]},{"given":"Jan","family":"Rutten","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2013,3,4]]},"reference":[{"key":"691:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/1087\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/1087\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T20:03:18Z","timestamp":1681243398000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/1087"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,4]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-9(1:9)2013","relation":{"is-same-as":[{"id-type":"arxiv","id":"1302.1046","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1302.1046","asserted-by":"subject"}],"is-referenced-by":[{"id-type":"doi","id":"10.1007\/978-3-642-40206-7_13","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2013,3,4]]},"article-number":"1087"}}