@inbook{22022a28f7944f52af92320523933ef1,
title = "Satisfiability of Quantitative Probabilistic CTL: Rise to the Challenge",
abstract = "The decidability of PCTL satisfiability is a challenging open problem in logic and formal verification. We give an overview of the existing results and proof techniques, and we also present some new results documenting the subtlety of the problem.",
keywords = "PCTL, Probabilistic temporal logics, Satisfiability",
author = "Miroslav Chodil and Anton{\'i}n Ku{\v c}era and Jan K{\v r}et{\'i}nsk{\'y}",
note = "Publisher Copyright: {\textcopyright} 2022, Springer Nature Switzerland AG.",
year = "2022",
doi = "10.1007/978-3-031-22337-2_18",
language = "English",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Science and Business Media Deutschland GmbH",
pages = "364--387",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
}