Complexity of checking strong satisfiability of reactive system specifications

被引:0
|
作者
机构
[1] Shimakawa, Masaya
[2] Hagihara, Shigeki
[3] Yonezaki, Naoki
来源
| 1600年 / Springer Verlag卷 / 117期
关键词
Specifications;
D O I
10.1007/978-3-319-11629-7_6
中图分类号
学科分类号
摘要
引用
收藏
相关论文
共 50 条
  • [41] Automatic checking of instruction specifications
    Fernandez, M
    Ramsey, N
    PROCEEDINGS OF THE 1997 INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, 1997, : 326 - 336
  • [42] Type Checking Circus Specifications
    Xavier, Manuela
    Cavalcanti, Ana
    Sampaio, Augusto
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2008, 195 (0C) : 75 - 93
  • [43] Model checking interactor specifications
    Campos J.C.
    Harrison M.D.
    Automated Software Engineering, 2001, 8 (3-4) : 275 - 310
  • [44] Computational Complexity of Quantum Satisfiability
    Herrmann, Christian
    Ziegler, Martin
    26TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2011), 2011, : 175 - 184
  • [45] A COMPLEXITY INDEX FOR SATISFIABILITY PROBLEMS
    BOROS, E
    CRAMA, Y
    HAMMER, PL
    SAKS, M
    SIAM JOURNAL ON COMPUTING, 1994, 23 (01) : 45 - 49
  • [46] Computational Complexity of Quantum Satisfiability
    Herrmann, Christian
    Ziegler, Martin
    JOURNAL OF THE ACM, 2016, 63 (02)
  • [47] The complexity of minimal satisfiability problems
    Kirousis, LM
    Kolaitis, PG
    INFORMATION AND COMPUTATION, 2003, 187 (01) : 20 - 39
  • [48] Boolean Satisfiability Solvers and Their Applications in Model Checking
    Vizel, Yakir
    Weissenbacher, Georg
    Malik, Sharad
    PROCEEDINGS OF THE IEEE, 2015, 103 (11) : 2021 - 2035
  • [49] Satisfiability checking using Boolean Expression Diagrams
    Poul F. Williams
    Henrik R. Andersen
    Henrik Hulgaard
    International Journal on Software Tools for Technology Transfer, 2003, 5 (1) : 4 - 14
  • [50] Variable and Clause Elimination for LTL Satisfiability Checking
    Suda, Martin
    MATHEMATICS IN COMPUTER SCIENCE, 2015, 9 (03) : 327 - 344