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 条
  • [1] The satisfiability problem for probabilistic CTL
    Brazdil, Tomas
    Forejt, Vojtech
    Kretinsky, Jan
    Kucera, Antonin
    TWENTY-THIRD ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2008, : 391 - 402
  • [2] THE COMPLEXITY OF SATISFIABILITY FOR FRAGMENTS OF CTL AND CTL
    Meier, Arne
    Thomas, Michael
    Vollmer, Heribert
    Mundhenk, Martin
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2009, 20 (05) : 901 - 918
  • [3] On the Satisfiability and Validity Problems in the Propositional Godel Logic
    Guller, Dusan
    COMPUTATIONAL INTELLIGENCE, 2012, 399 : 211 - 227
  • [4] The Complexity of Satisfiability for Fragments of CTL and CTL star
    Meier, Arne
    Mundhenk, Martin
    Thomas, Michael
    Vollmer, Heribert
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2008, 223 (0C) : 201 - 213
  • [5] NSNet: A General Neural Probabilistic Framework for Satisfiability Problems
    Li, Zhaoyu
    Si, Xujie
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 35, NEURIPS 2022, 2022,
  • [6] Generalized Probabilistic Satisfiability
    De Bona, Glauber
    Cozman, Fabio G.
    Finger, Marcelo
    2013 BRAZILIAN CONFERENCE ON INTELLIGENT SYSTEMS (BRACIS), 2013, : 182 - 188
  • [7] Probabilistic satisfiability and decomposition
    Nguetse, GBD
    Hansen, P
    Jaumard, B
    SYMBOLIC AND QUANTITATIVE APPROACHES TO REASONING AND UNCERTAINTY, 1995, 946 : 151 - 161
  • [8] Generalized Probabilistic Satisfiability
    Caleiro C.
    Casal F.
    Mordido A.
    Electronic Notes in Theoretical Computer Science, 2017, 332 : 39 - 56
  • [9] The Complexity of Satisfiability for Fragments of CTL and CTL (vol 20, pg 901, 2009)
    Meier, Arne
    Thomas, Michael
    Vollmer, Heribert
    Mundhenk, Martin
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2015, 26 (08) : 1189 - 1190
  • [10] Easy Cases of Probabilistic Satisfiability
    Kim Allan Andersen
    Daniele Pretolani
    Annals of Mathematics and Artificial Intelligence, 2001, 33 : 69 - 91
12345