The satisfiability problem for a quantitative fragment of PCTL

• Authors: CHODIL Miroslav; KUČERA Antonín
• Year of publication: 2024
• Type: Article in Periodical
• Magazine / Source: Journal of Computer and System Sciences
• MU Faculty or unit: Faculty of Informatics
• Web: Elsevier
• Doi: http://dx.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

• Efektivní analýza a optimalizace pravděpodobnostních systémů a her
• Modelování, analýza a verifikace (2023)
• Zapojení studentů Fakulty informatiky do mezinárodní vědecké komunity 24
• Modeling, analysis, and verification (2024)