All Stories

  1. The Finite Satisfiability Problem for PCTL is Undecidable

    Article • Journal of the ACM, January 2026, ACM (Association for Computing Machinery)

    Antonin Kucera

  2. The Finite Satisfiability Problem for Probabilistic Computational Tree Logic is Undecidable

    Article • July 2024, ACM (Association for Computing Machinery)

    Antonin Kucera