Thin MSO with a Probabilistic Path Quantifier. ICALP, 2016 PDF
Mikołaj Bojańczyk, Hugo Gimbert, Edon Kelmendi
Emptiness of Zero Automata Is Decidable. ICALP, 2017 PDF
Mikołaj Bojańczyk, Edon Kelmendi, Michal Skrzypczak
MSO+∇ is undecidable. LICS, 2019 PDF
Consider a probabilistic extension of MSO over infinite binary trees, which allows formulas saying “almost surely a branch satisfies ”. This logic was introduced by Mio and Michalewski, and it generalises known (qualitative) probabilistic logics such as probabilistic CTL or probabilistic CTL*. Paper  shows that this logic is undecidable. On the other hand, the weak fragment of the logic (where the usual set quantifiers are restricted to range over finite sets) is decidable, which follows from papers  and . Paper  shows that the weak fragment of the probabilistic logic (and a bit more) can be compiled into an automaton model, while paper  shows that emptiness for the automaton model is decidable.