The satisfiability problem for a quantitative fragment of PCTL

Open Webpage

Miroslav Chodil, Antonín Kucera

Published: 01 Jan 2024, Last Modified: 23 Jul 2025J. Comput. Syst. Sci. 2024EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: 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.