Publication details
The Satisfiability and Validity Problems for Probabilistic CTL
| Authors | |
|---|---|
| Year of publication | 2024 |
| Type | Article in Proceedings |
| Conference | 18th International Conference on Reachability Problems, RP 2024 |
| MU Faculty or unit | |
| Citation | |
| Doi | https://doi.org/10.1007/978-3-031-72621-7_2 |
| Keywords | Satisfiability; Probabilistic temporal logics; Probabilistic CTL |
| Description | Probabilistic CTL is obtained from the standard CTL (Computational Tree Logic) by replacing the existential and universal path quantifiers with the probabilistic operator where the probability of runs satisfying a given path formula is bounded by a rational constant. We survey the existing results about the satisfiability and validity problems for probabilistic CTL, and we also present some of the underlying proof techniques. |