Observability of boolean networks is NP-hard

Dmitriy Laschov, Michael Margaliot, Guy Even

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publication2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2012
DOIs
StatePublished - 2012
Event2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2012 - Eilat, Israel
Duration: 14 Nov 201217 Nov 2012

Publication series

Name2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2012

Conference

Conference2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2012
Country/TerritoryIsrael
CityEilat
Period14/11/1217/11/12

Fingerprint

Dive into the research topics of 'Observability of boolean networks is NP-hard'. Together they form a unique fingerprint.

Cite this