External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

The Finite Satisfiability Problem for PCTL is Undecidable

Miroslav Chodil, Antonín Kucera 0001. The Finite Satisfiability Problem for PCTL is Undecidable. In Pawel Sobocinski 0001, Ugo Dal Lago, Javier Esparza, editors, Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2024, Tallinn, Estonia, July 8-11, 2024. ACM, 2024. [doi]

Authors

Miroslav Chodil

This author has not been identified. Look up 'Miroslav Chodil' in Google

Antonín Kucera 0001

This author has not been identified. Look up 'Antonín Kucera 0001' in Google
runs on