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]
@inproceedings{Chodil024,
title = {The Finite Satisfiability Problem for PCTL is Undecidable},
author = {Miroslav Chodil and Antonín Kucera 0001},
year = {2024},
doi = {10.1145/3661814.3662145},
url = {https://doi.org/10.1145/3661814.3662145},
researchr = {https://researchr.org/publication/Chodil024},
cites = {0},
citedby = {0},
booktitle = {Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2024, Tallinn, Estonia, July 8-11, 2024},
editor = {Pawel Sobocinski 0001 and Ugo Dal Lago and Javier Esparza},
publisher = {ACM},
}