Minimal controllability of conjunctive Boolean networks is NP-complete

被引：37
|
作者：
Weiss, Eyal [1 ]
Margaliot, Michael [1 ,2 ]
Even, Guy [1 ]
机构：
[1] Tel Aviv Univ, Dept EE Syst, IL-69978 Tel Aviv, Israel
[2] Tel Aviv Univ, Sagol Sch Neurosci, IL-69978 Tel Aviv, Israel
来源：
AUTOMATICA | 2018年 / 92卷
基金：
以色列科学基金会;
关键词：
MODELS;
D O I：
10.1016/j.automatica.2018.02.014
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Given a conjunctive Boolean network (CBN) with n state-variables, we consider the problem of finding a minimal set of state-variables to directly affect with an input so that the resulting conjunctive Boolean control network (CBCN) is controllable. We give a necessary and sufficient condition for controllability of a CBCN; an O(n(2))-time algorithm for testing controllability; and prove that nonetheless the minimal controllability problem for CBNs is NP-hard. (C) 2018 Elsevier Ltd. All rights reserved.
引用
收藏
页码：56 / 62
页数：7
相关论文
共 50 条
  • [31] Strategic Argumentation is NP-Complete
    Governatori, G.
    Olivieri, F.
    Scannapieco, S.
    Rotolo, A.
    Cristani, M.
    21ST EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE (ECAI 2014), 2014, 263 : 399 - 404
  • [32] Decidability of NP-Complete Problems
    A. A. Vagis
    A. M. Gupal
    Cybernetics and Systems Analysis, 2022, 58 : 914 - 916
  • [33] ON ONE NP-COMPLETE PROBLEM
    DEMEL, J
    DEMLOVA, M
    KYBERNETIKA, 1995, 31 (02) : 207 - 211
  • [34] System BV is NP-complete
    Kahramanogullari, Ozan
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2006, 143 : 87 - 99
  • [35] Splitting NP-complete sets
    Glasser, Christian
    Pavan, A.
    Selman, Alan L.
    Zhang, Liyu
    SIAM JOURNAL ON COMPUTING, 2008, 37 (05) : 1517 - 1535
  • [36] AN NP-COMPLETE MATCHING PROBLEM
    PLAISTED, DA
    ZAKS, S
    DISCRETE APPLIED MATHEMATICS, 1980, 2 (01) : 65 - 72
  • [37] Choco Banana is NP-Complete∗
    Iwamoto, Chuzo
    Tokunaga, Takeru
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2024, E107A (09) : 1488 - 1491
  • [38] Splitting number is NP-complete
    Faria, L
    de Figueiredo, CMH
    Mendonça, CFX
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 1998, 1517 : 285 - 297
  • [39] System BV is NP-complete
    Kahramanogullari, Ozan
    ANNALS OF PURE AND APPLIED LOGIC, 2008, 152 (1-3) : 107 - 121
  • [40] The STO problem is NP-complete
    Krysta, P
    Pacholski, L
    JOURNAL OF SYMBOLIC COMPUTATION, 1999, 27 (02) : 207 - 219
12345