Miroslav Chodil
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
3
Venues
3
Active years
2021–2025
Best venue rank
A*
Where they publish
Papers
3 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2025 | ICALP | The Satisfiability and Validity Problems for Probabilistic Computational Tree Logic Are Highly Undecidable. | Miroslav Chodil, Antonn Kucera |
| 2024 | LICS | The Finite Satisfiability Problem for PCTL is Undecidable. | Miroslav Chodil, Antonn Kucera |
| 2021 | FCT | The Satisfiability Problem for a Quantitative Fragment of PCTL. | Miroslav Chodil, Antonn Kucera |