The satisfiability problem for a quantitative fragment of PCTL
| Authors | |
|---|---|
| Year of publication | 2024 |
| Type | Article in Periodical |
| Magazine / Source | Journal of Computer and System Sciences |
| MU Faculty or unit | |
| Citation | |
| web | Elsevier |
| Doi | https://doi.org/10.1016/j.jcss.2023.103478 |
| Keywords | Satisfiability; Probabilistic temporal logics; PCTL |
| Description | We propose a generic method for proving the decidability of the finite satisfiability problem for PCTL fragments and demonstrate its applicability in several non-trivial examples.(c) 2023 Elsevier Inc. All rights reserved. |
| Related projects: |