The Finite Satisfiability Problem for PCTL is Undecidable

Summary

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Miroslav Chodil, Antonín Kučera

Journal title: Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2024)

Journal publisher: Association for Computing Machinery

Published year: 2024

DOI identifier: 10.1145/3661814.3662145

ISBN: 979-8-4007-0660-8