The Satisfiability Problem for a Quantitative Fragment of PCTL
Autoři | |
---|---|
Rok publikování | 2024 |
Druh | Článek v odborném periodiku |
Časopis / Zdroj | Journal of Computer and System Sciences |
Fakulta / Pracoviště MU | |
Citace | |
Doi | http://dx.doi.org/10.1016/j.jcss.2023.103478 |
Klíčová slova | probabilistic temporal logics; satisfiability |
Popis | 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. |
Související projekty: |