Other formats:
BibTeX
LaTeX
RIS
@article{2308503, author = {Chodil, Miroslav and Kučera, Antonín}, article_number = {103478}, doi = {http://dx.doi.org/10.1016/j.jcss.2023.103478}, keywords = {probabilistic temporal logics; satisfiability}, language = {eng}, issn = {0022-0000}, journal = {Journal of Computer and System Sciences}, title = {The Satisfiability Problem for a Quantitative Fragment of PCTL}, url = {https://www.sciencedirect.com/science/article/pii/S0022000023000831?via%3Dihub}, volume = {139}, year = {2024} }
TY - JOUR ID - 2308503 AU - Chodil, Miroslav - Kučera, Antonín PY - 2024 TI - The Satisfiability Problem for a Quantitative Fragment of PCTL JF - Journal of Computer and System Sciences VL - 139 IS - 103478 SP - 1-16 EP - 1-16 PB - Elsevier SN - 00220000 KW - probabilistic temporal logics KW - satisfiability UR - https://www.sciencedirect.com/science/article/pii/S0022000023000831?via%3Dihub N2 - 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. ER -
CHODIL, Miroslav and Antonín KUČERA. The Satisfiability Problem for a Quantitative Fragment of PCTL. \textit{Journal of Computer and System Sciences}. Elsevier, 2024, vol.~139, No~103478, p.~1-16. ISSN~0022-0000. Available from: https://dx.doi.org/10.1016/j.jcss.2023.103478.
|