Observability of boolean networks is NP-hard

Author

Laschov, Dmitriy ; Margaliot, Michael ; Even, Guy

Author_Institution

Dept. of EE-Syst., Tel Aviv Univ., Ramat Aviv, Israel

fYear

2012

fDate

14-17 Nov. 2012

Firstpage

1

Lastpage

5

Abstract

Boolean networks (BNs) are discrete-time dynamical systems with Boolean state-variables and Boolean outputs. BNs are recently attracting considerable interest as computational models for genetic and cellular networks. We study the control-theoretic notion of observability, that is, the possibility of uniquely determining the initial state given a time sequence of outputs. We show that the problem of determining whether a BN is observable or not is NP-hard. Our results are based on combining the algebraic representation of BNs derived by D. Cheng with a graph-theoretic approach.

Keywords

Boolean functions; cellular biophysics; computational complexity; discrete time systems; genetic algorithms; graph theory; observability; BN algebraic representation; Boolean networks; Boolean outputs; NP-hard problem; cellular networks; computational models; control theoretic notion; discrete-time dynamical systems; genetic networks; graph theoretic approach; observability Boolean state-variables; output time sequence; Biological system modeling; Color; Educational institutions; Observability; Polynomials;

fLanguage

English

Publisher

ieee

Conference_Titel

Electrical & Electronics Engineers in Israel (IEEEI), 2012 IEEE 27th Convention of

Conference_Location

Eilat

Print_ISBN

978-1-4673-4682-5

Type

conf

DOI

10.1109/EEEI.2012.6377137

Filename

6377137