Miroslav Chodil
Doctoral student at Masaryk university.
Working on the satisfiability problem for Probabilistic CTL.
Working on the satisfiability problem for Probabilistic CTL.
Email:
first name @ this domain
X (Twitter):
@miroslavchodil
Awards and honors
2024
Distinguished paper award (LICS).
2019
Dean's award for an outstanding Master's thesis (Masaryk university).
Publications
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.
(Invited) 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.