Minimal controllability of conjunctive Boolean networks is NP-complete

Eyal Weiss; Michael Margaliot; Guy Even

doi:10.1016/j.automatica.2018.02.014

Minimal controllability of conjunctive Boolean networks is NP-complete

Eyal Weiss, Michael Margaliot, Guy Even

School of Electrical Engineering

Tel Aviv University

Research output: Contribution to journal › Article › peer-review

Abstract

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²)-time algorithm for testing controllability; and prove that nonetheless the minimal controllability problem for CBNs is NP-hard.

Original language	English
Pages (from-to)	56-62
Number of pages	7
Journal	Automatica
Volume	92
DOIs	https://doi.org/10.1016/j.automatica.2018.02.014
State	Published - Jun 2018

All Science Journal Classification (ASJC) codes

Control and Systems Engineering
Electrical and Electronic Engineering

Access to Document

10.1016/j.automatica.2018.02.014

Cite this

@article{ce035926c3d54590a9e39c325ee05fe5,

title = "Minimal controllability of conjunctive Boolean networks is NP-complete",

abstract = "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(n2)-time algorithm for testing controllability; and prove that nonetheless the minimal controllability problem for CBNs is NP-hard.",

author = "Eyal Weiss and Michael Margaliot and Guy Even",

note = "Publisher Copyright: {\textcopyright} 2018 Elsevier Ltd",

year = "2018",

month = jun,

doi = "10.1016/j.automatica.2018.02.014",

language = "الإنجليزيّة",

volume = "92",

pages = "56--62",

journal = "Automatica",

issn = "0005-1098",

publisher = "Elsevier Ltd.",

}

TY - JOUR

T1 - Minimal controllability of conjunctive Boolean networks is NP-complete

AU - Weiss, Eyal

AU - Margaliot, Michael

AU - Even, Guy

PY - 2018/6

Y1 - 2018/6

N2 - 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(n2)-time algorithm for testing controllability; and prove that nonetheless the minimal controllability problem for CBNs is NP-hard.

AB - 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(n2)-time algorithm for testing controllability; and prove that nonetheless the minimal controllability problem for CBNs is NP-hard.

UR - http://www.scopus.com/inward/record.url?scp=85044093975&partnerID=8YFLogxK

U2 - 10.1016/j.automatica.2018.02.014

DO - 10.1016/j.automatica.2018.02.014

M3 - مقالة

SN - 0005-1098

VL - 92

SP - 56

EP - 62

JO - Automatica

JF - Automatica

ER -

Minimal controllability of conjunctive Boolean networks is NP-complete

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this