Miroslav Chodil

According to our database, Miroslav Chodil authored at least 5 papers between 2021 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2025

The Satisfiability and Validity Problems for Probabilistic Computational Tree Logic Are Highly Undecidable.

Miroslav Chodil, Antonín Kucera

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

2024

The General and Finite Satisfiability Problems for PCTL are Undecidable.

Miroslav Chodil, Antonín Kucera

CoRR, 2024

The Finite Satisfiability Problem for PCTL is Undecidable.

Miroslav Chodil, Antonín Kucera

Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

2022

Satisfiability of Quantitative Probabilistic CTL: Rise to the Challenge.

Miroslav Chodil, Antonín Kucera, Jan Kretínský

Proceedings of the Principles of Systems Design, 2022

2021

The Satisfiability Problem for a Quantitative Fragment of PCTL.

Miroslav Chodil, Antonín Kucera

Proceedings of the Fundamentals of Computation Theory - 23rd International Symposium, 2021