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 | |
| Doi | http://dx.doi.org/10.1016/j.jcss.2023.103478 |
| Keywords | probabilistic temporal logics; satisfiability |
| Description | We propose a generic method for proving the decidability of the finite satisfiability problem for PCTL fragments. The applicability of our method is demonstrated in several non-trivial examples. |
| Related projects: |