| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 7108798 | Automatica | 2018 | 7 Pages |
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.
Related Topics
Physical Sciences and Engineering
Engineering
Control and Systems Engineering
Authors
Eyal Weiss, Michael Margaliot, Guy Even,