Completeness of a Branching-Time Logic with Possible Choices

被引：0
|
作者：
Roberto Ciuni
Alberto Zanardo
机构：
[1] Delft University of Technology,Department of Philosophy
[2] University of Padova,Department of Pure and Applied Mathematics
来源：
Studia Logica | 2010年 / 96卷
关键词：
Branching-Time; Agency; Choices; Completeness; BTC;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
In this paper we present BTC, which is a complete logic for branchingtime whose modal operator quantifies over histories and whose temporal operators involve a restricted quantification over histories in a given possible choice. This is a technical novelty, since the operators of the usual logics for branching-time such as CTL express an unrestricted quantification over histories and moments. The value of the apparatus we introduce is connected to those logics of agency that are interpreted on branching-time, as for instance Stit Logics.
引用
收藏
页码：393 / 420
页数：27
相关论文
共 50 条
  • [1] Completeness of a Branching-Time Logic with Possible Choices
    Ciuni, Roberto
    Zanardo, Alberto
    STUDIA LOGICA, 2010, 96 (03) : 393 - 420
  • [2] Memoryful branching-time logic
    Kupferman, Orna
    Vardi, Moshe Y.
    21ST ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2006, : 265 - +
  • [3] A Monitoring Tool for a Branching-Time Logic
    Attard, Duncan Paul
    Francalanza, Adrian
    RUNTIME VERIFICATION, (RV 2016), 2016, 10012 : 473 - 481
  • [4] Possible events in branching-time model
    Klinowski, Mateusz
    DIAMETROS, 2005, 3 : 1 - 26
  • [5] Branching-time temporal logic and tree automata
    Kupferman, O
    Grumberg, O
    INFORMATION AND COMPUTATION, 1996, 125 (01) : 62 - 69
  • [6] Cactus: A branching-time logic programming language
    Rondogiannis, P
    Gergatsoulis, M
    Panayiotopoulos, T
    QUALITATIVE AND QUANTITATIVE PRACTICAL REASONING, 1997, 1244 : 511 - 524
  • [7] A decidable dense branching-time temporal logic
    La Torre, S
    Napoli, M
    FST TCS 2000: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2000, 1974 : 139 - 150
  • [8] An extended branching-time ockhamist temporal logic
    Brown M.
    Goranko V.
    Journal of Logic, Language and Information, 1999, 8 (2) : 143 - 166
  • [9] ON THE WEAK ADEQUACY OF BRANCHING-TIME TEMPORAL LOGIC
    SCHNOEBELEN, P
    PINCHINAT, S
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 432 : 377 - 388
  • [10] Incremental Witness Generation for Branching-Time Logic CTL*
    Luo, Xiangyu
    Liang, Sen
    Zheng, Lixiao
    Chen, Zuxi
    Yang, Fan
    IEEE TRANSACTIONS ON RELIABILITY, 2022, 71 (02) : 933 - 950
12345