References & Citations
Computer Science > Logic in Computer Science
Title: The General and Finite Satisfiability Problems for PCTL are Undecidable
(Submitted on 16 Apr 2024)
Abstract: The general/finite PCTL satisfiability problem asks whether a given PCTL formula has a general/finite model. We show that the finite PCTL satisfiability problem is undecidable, and the general PCTL satisfiability problem is even highly undecidable (beyond the arithmetical hierarchy). Consequently, there are no sound deductive systems proving all generally/finitely valid PCTL formulae.
Link back to: arXiv, form interface, contact.