{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T22:32:39Z","timestamp":1757457159622,"version":"3.28.0"},"reference-count":35,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T00:00:00Z","timestamp":1687737600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T00:00:00Z","timestamp":1687737600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,26]]},"DOI":"10.1109\/lics56636.2023.10175800","type":"proceedings-article","created":{"date-parts":[[2023,7,14]],"date-time":"2023-07-14T17:18:23Z","timestamp":1689355103000},"page":"1-13","source":"Crossref","is-referenced-by-count":1,"title":["The Probabilistic Rabin Tree Theorem<sup>*<\/sup>"],"prefix":"10.1109","author":[{"given":"Damian","family":"Niwi\u0144ski","sequence":"first","affiliation":[{"name":"University of Warsaw,Institute of Informatics"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pawe\u0142","family":"Parys","sequence":"additional","affiliation":[{"name":"University of Warsaw,Institute of Informatics"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha\u0142","family":"Skrzypczak","sequence":"additional","affiliation":[{"name":"University of Warsaw,Institute of Informatics"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","first-page":"121","article-title":"Quantitative stochastic parity games","author":"chatterjee","year":"2004","journal-title":"SODA"},{"doi-asserted-by":"publisher","key":"ref35","DOI":"10.1016\/0022-0000(86)90029-2"},{"key":"ref12","first-page":"265","article-title":"Probabilistic linear-time model checking: An overview of the automata-theoretic approach","volume":"1601","author":"vardi","year":"1999","journal-title":"ARTS"},{"key":"ref34","first-page":"134","article-title":"Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition","volume":"33","author":"collins","year":"1975","journal-title":"Automata Theory and Formal Languages"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1016\/S0304-3975(02)00452-8"},{"year":"2001","author":"izumi","article-title":"The measure of an omega regular language is rational","key":"ref14"},{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.1109\/LICS.1989.39173"},{"doi-asserted-by":"publisher","key":"ref30","DOI":"10.1016\/0304-3975(80)90003-1"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1145\/210332.210339"},{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1007\/978-3-662-03718-8"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1109\/SFCS.1985.12"},{"doi-asserted-by":"publisher","key":"ref32","DOI":"10.1525\/9780520348097"},{"key":"ref2","first-page":"1","article-title":"On a decision method in restricted second-order arithmetic","author":"b\u00fcchi","year":"1962","journal-title":"Logic, Methodology and Philosophy of Science, Proceeding of the 1960 International Congress"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.2307\/1995086"},{"key":"ref17","first-page":"489","article-title":"On the problem of computing the probability of regular sets of trees","volume":"45","author":"michalewski","year":"2015","journal-title":"FSTTCS"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1016\/j.ic.2017.04.012"},{"key":"ref19","article-title":"The uniform measure of simple regular sets of infinite trees","author":"przyby?ko","year":"2020","journal-title":"Inf Comput"},{"key":"ref18","first-page":"136:1","article-title":"Computing measures of Weak-MSO definable sets of trees","volume":"168","author":"niwi?ski","year":"2020","journal-title":"ICALP"},{"year":"2004","author":"perrin","journal-title":"Infinite words automata semigroups logic and games","key":"ref24"},{"key":"ref23","first-page":"402","article-title":"Fixed points vs. infinite generation","author":"niwi?ski","year":"1988","journal-title":"LICS"},{"key":"ref26","article-title":"The probabilistic rabin tree theorem","author":"niwi?ski","year":"2023","journal-title":"CoRR"},{"year":"2001","author":"arnold","journal-title":"Rudiments of mu-calculus","key":"ref25"},{"year":"1971","author":"paz","journal-title":"Introduction to Probabilistic Automata","key":"ref20"},{"key":"ref22","first-page":"287","article-title":"On decision problems for probabilistic B&#x00FC;chi automata","volume":"4962","author":"baier","year":"2008","journal-title":"FOSSACS"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1007\/978-3-642-14162-1_44"},{"key":"ref28","first-page":"35","article-title":"Sur quelques proprietes des ensembles (A)","author":"lusin","year":"1918","journal-title":"Bull Acad Sci Cracovie A"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1007\/3-540-60246-1_160"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1007\/978-1-4615-9964-7"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.2168\/LMCS-8(4:18)2012"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1007\/978-3-642-32589-2_26"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1145\/2629336"},{"key":"ref4","volume":"2","author":"flum","year":"2008","journal-title":"Logic and Automata History and Perspectives [in Honor of Wolfgang Thomas]"},{"key":"ref3","first-page":"389","article-title":"Languages, automata, and logic","author":"thomas","year":"1996","journal-title":"Handbook of Formal Languages"},{"year":"2021","author":"pin","journal-title":"Handbook of Automata Theory","key":"ref6"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1017\/CBO9781139236119"}],"event":{"name":"2023 38th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","start":{"date-parts":[[2023,6,26]]},"location":"Boston, MA, USA","end":{"date-parts":[[2023,6,29]]}},"container-title":["2023 38th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10175635\/10175671\/10175800.pdf?arnumber=10175800","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T17:59:33Z","timestamp":1690912773000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10175800\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,26]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/lics56636.2023.10175800","relation":{},"subject":[],"published":{"date-parts":[[2023,6,26]]}}}