The Satisfiability and Validity Problems for Probabilistic CTL

被引：0
|
作者：
Kucera, Antonin [1 ]
机构：
[1] Masaryk Univ, Fac Informat, Bot 68a, Brno 60200, Czech Republic
来源：
REACHABILITY PROBLEMS, RP 2024 | 2024年 / 15050卷
关键词：
Satisfiability; Probabilistic temporal logics; Probabilistic CTL; TIME; LOGIC;
D O I：
10.1007/978-3-031-72621-7_2
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
Probabilistic CTL is obtained from the standard CTL (Computational Tree Logic) by replacing the existential and universal path quantifiers with the probabilistic operator where the probability of runs satisfying a given path formula is bounded by a rational constant. We survey the existing results about the satisfiability and validity problems for probabilistic CTL, and we also present some of the underlying proof techniques.
引用
收藏
页码：9 / 18
页数：10
相关论文
共 50 条
12345