RNDr. Miroslav Chodil

2024

• The Finite Satisfiability Problem for PCTL is Undecidable

  CHODIL Miroslav KUČERA Antonín

  Článek ve sborníku

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

• The satisfiability problem for a quantitative fragment of PCTL

  CHODIL Miroslav KUČERA Antonín

  Článek v odborném periodiku

  Journal of Computer and System Sciences, rok: 2024, ročník: 139, vydání: 103478, DOI

2022

• Satisfiability of Quantitative Probabilistic CTL: Rise to the Challenge

  CHODIL Miroslav KUČERA Antonín KŘETÍNSKÝ Jan

  Článek ve sborníku

  Principles of Systems Design - Essays Dedicated to Thomas A. Henzinger on the Occasion of His 60th Birthday, rok: 2022

2021

• The Satisfiability Problem for a Quantitative Fragment of PCTL

  CHODIL Miroslav KUČERA Antonín

  Článek ve sborníku

  Fundamentals of Computation Theory. 23rd International Symposium, FCT 2021, rok: 2021