Satisfiability of Quantitative Probabilistic CTL: Rise to the Challenge

Investor logo

Warning

This publication doesn't include Faculty of Arts. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

CHODIL Miroslav KUČERA Antonín KŘETÍNSKÝ Jan

Year of publication 2022
Type Article in Proceedings
Conference Principles of Systems Design - Essays Dedicated to Thomas A. Henzinger on the Occasion of His 60th Birthday
MU Faculty or unit

Faculty of Informatics

Citation
Web The book URL.
Doi http://dx.doi.org/10.1007/978-3-031-22337-2_18
Keywords probabilistic logics; satisfiablity
Description 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.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.