Satisfiability of Quantitative Probabilistic CTL: Rise to the Challenge. - Miroslav Chodil; Antonín Kucera 001; Jan Kretínský (Principles of Systems Design, 2022)

The Finite Satisfiability Problem for PCTL is Undecidable. - Miroslav Chodil; Antonín Kucera 001 (LICS, 2024)

The General and Finite Satisfiability Problems for PCTL are Undecidable. - Miroslav Chodil; Antonín Kucera 001 (CoRR, 2024)

The satisfiability problem for a quantitative fragment of PCTL. - Miroslav Chodil; Antonín Kucera 001 (J. Comput. Syst. Sci., 2024)

The Satisfiability and Validity Problems for Probabilistic Computational Tree Logic Are Highly Undecidable. - Miroslav Chodil; Antonín Kucera 001 (ICALP, 2025)