TY - GEN
T1 - Observability of boolean networks is NP-hard
AU - Laschov, Dmitriy
AU - Margaliot, Michael
AU - Even, Guy
PY - 2012
Y1 - 2012
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84871942038&partnerID=8YFLogxK
U2 - 10.1109/EEEI.2012.6377137
DO - 10.1109/EEEI.2012.6377137
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84871942038
SN - 9781467346801
T3 - 2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2012
BT - 2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2012
T2 - 2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2012
Y2 - 14 November 2012 through 17 November 2012
ER -