Miroslav Chodil, Antonín Kucera 0001. The Finite Satisfiability Problem for PCTL is Undecidable. In Pawel Sobocinski 0001, Ugo Dal Lago, Javier Esparza, editors, Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2024, Tallinn, Estonia, July 8-11, 2024. ACM, 2024. [doi]
Abstract is missing.