The satisfiability problem for a quantitative fragment of PCTL

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F24%3A00135189" target="_blank" >RIV/00216224:14330/24:00135189 - isvavai.cz</a>
Result on the web
<a href="https://www.sciencedirect.com/science/article/pii/S0022000023000831?via%3Dihub" target="_blank" >https://www.sciencedirect.com/science/article/pii/S0022000023000831?via%3Dihub</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.jcss.2023.103478" target="_blank" >10.1016/j.jcss.2023.103478</a>

Result language
angličtina
Original language name
The satisfiability problem for a quantitative fragment of PCTL
Original language 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.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
<a href="/en/project/GA21-24711S" target="_blank" >GA21-24711S: Efficient Analysis and Optimization for Probabilistic Systems and Games</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Publication year
2024
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Result description