Oracle circuits for branching-time model checking

被引：0
|
作者：
Schnoebelen, P
机构：
[1] ENS Cachan, Lab Specificat & Verificat, F-94235 Cachan, France
[2] CNRS, UMR 8643, F-94235 Cachan, France
来源：
AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS | 2003年 / 2719卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
A special class of oracle circuits with tree-vector form is introduced. It is shown that they can be evaluated in deterministic polynomial-time with a polylog number of adaptive queries to an NP oracle. This framework allows us to evaluate the precise computational complexity of model checking for some branching-time logics where it was known that the problem is NP-hard and coNP-hard.
引用
收藏
页码：790 / 801
页数：12
相关论文
共 50 条
  • [21] Mining Branching-Time Scenarios
    Fahland, Dirk
    Lo, David
    Maoz, Shahar
    2013 28TH IEEE/ACM INTERNATIONAL CONFERENCE ON AUTOMATED SOFTWARE ENGINEERING (ASE), 2013, : 443 - 453
  • [22] Branching-Time Temporal Logics with Minimal Model Quantifiers
    Mogavero, Fabio
    Murano, Aniello
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2009, 5583 : 396 - 409
  • [23] Memoryful branching-time logic
    Kupferman, Orna
    Vardi, Moshe Y.
    21ST ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2006, : 265 - +
  • [24] On the Complexity of Branching-Time Logics
    Weber, Volker
    COMPUTER SCIENCE LOGIC, PROCEEDINGS, 2009, 5771 : 530 - 545
  • [25] Model checking branching time logics
    Schnoebelen, Ph.
    TIME 2007: 14th International Symposium on Temporal Representation and Reasoning, Proceedings, 2007, : 5 - 5
  • [26] Branching-time logics with path relativisation
    Latte, Markus
    Lange, Martin
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2014, 80 (02) : 375 - 389
  • [27] Topological Aspects of Branching-Time Semantics
    Michela Sabbadin
    Alberto Zanardo
    Studia Logica, 2003, 75 (3) : 271 - 286
  • [28] Branching-time logics and fairness, revisited
    Latte, Markus
    MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 2021, 31 (09) : 1135 - 1144
  • [29] A Monitoring Tool for a Branching-Time Logic
    Attard, Duncan Paul
    Francalanza, Adrian
    RUNTIME VERIFICATION, (RV 2016), 2016, 10012 : 473 - 481
  • [30] SATISFIABILITY GAMES FOR BRANCHING-TIME LOGICS
    Friedmann, Oliver
    Latte, Markus
    Lange, Martin
    LOGICAL METHODS IN COMPUTER SCIENCE, 2013, 9 (04)
12345