Minimal controllability of conjunctive Boolean networks is NP-complete

Eyal Weiss, Michael Margaliot, Guy Even

Research output: Contribution to journalArticlepeer-review

34 Scopus citations

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.

Original languageEnglish
Pages (from-to)56-62
Number of pages7
JournalAutomatica
Volume92
DOIs
StatePublished - Jun 2018
Externally publishedYes

Bibliographical note

Publisher Copyright:
© 2018 Elsevier Ltd

Funding

This research was supported in part by research grants from the Israeli Ministry of Science, Technology & Space , and the Israel Science Foundation (ISF grant 410/15 ). The material in this paper was not presented at any conference. This paper was recommended for publication in revised form by Associate Editor Graziano Chesi under the direction of Editor Richard Middleton. This research was supported in part by research grants from the Israeli Ministry of Science, Technology & Space, and the Israel Science Foundation (ISF grant 410/15). The material in this paper was not presented at any conference. This paper was recommended for publication in revised form by Associate Editor Graziano Chesi under the direction of Editor Richard Middleton.

FundersFunder number
Israeli Ministry of Science, Technology & Space
Ministry of Science, Technology and Space
Israel Science Foundation410/15

    Fingerprint

    Dive into the research topics of 'Minimal controllability of conjunctive Boolean networks is NP-complete'. Together they form a unique fingerprint.

    Cite this