CHODIL, Miroslav and Antonín KUČERA. The Satisfiability Problem for a Quantitative Fragment of PCTL. 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.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name The Satisfiability Problem for a Quantitative Fragment of PCTL
Authors CHODIL, Miroslav and Antonín KUČERA.
Edition Journal of Computer and System Sciences, Elsevier, 2024, 0022-0000.
Other information
Original language English
Type of outcome Article in a journal
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher United States of America
Confidentiality degree is not subject to a state or trade secret
WWW Elsevier
Impact factor Impact factor: 1.100 in 2022
Organization unit Faculty of Informatics
Doi http://dx.doi.org/10.1016/j.jcss.2023.103478
UT WoS 001097220800001
Keywords in English probabilistic temporal logics; satisfiability
Tags International impact, Reviewed
Changed by Changed by: prof. RNDr. Antonín Kučera, Ph.D., učo 2508. Changed: 19/8/2024 10:37.
Abstract
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.
Links
GA21-24711S, research and development projectName: Efektivní analýza a optimalizace pravděpodobnostních systémů a her (Acronym: Efektivní analýza a optimalizace pravděpodobnostní)
Investor: Czech Science Foundation
MUNI/A/1081/2022, interní kód MUName: Modelování, analýza a verifikace (2023)
Investor: Masaryk University
PrintDisplayed: 29/8/2024 12:09