Miroslav Chodil

A doctoral student at Masaryk university.

4. Miroslav Chodil and Antonín Kučera. “The Finite Satisfiability Problem for PCTL is Undecidable”. In: Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science. 2024, pp. 1–14.

3. Miroslav Chodil and Antonín Kučera. “The satisfiability problem for a quantitative fragment of PCTL”. In: Journal of Computer and System Sciences 139 (2024), p. 103478.

2. Miroslav Chodil, Antonín Kučera, and Jan Křetínský. “Satisfiability of quantitative probabilistic ctl: Rise to the challenge”. In: Principles of Systems Design: Essays Dedicated to Thomas A. Henzinger on the Occasion of His 60th Birthday. Springer, 2022, pp. 364–387.

1. Miroslav Chodil and Antonín Kučera. “The Satisfiability Problem for a Quantitative Fragment of PCTL”. In: International Symposium on Fundamentals of Computation Theory. 2021, pp. 149–161.