Minimal controllability of conjunctive Boolean networks is NP-complete

• Autores: Eyal Weiss, Michael Margaliot, Guy Even
• Localización: Automatica: A journal of IFAC the International Federation of Automatic Control, ISSN 0005-1098, Vol. 92, 2018, págs. 56-62
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • Given a conjunctive Boolean network (CBN) with 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 -time algorithm for testing controllability; and prove that nonetheless the minimal controllability problem for CBNs is NP-hard.