Observability of boolean networks is NP-hard

Dmitriy Laschov; Michael Margaliot; Guy Even

doi:10.1109/EEEI.2012.6377137

Observability of boolean networks is NP-hard

Dmitriy Laschov^*, Michael Margaliot, Guy Even

^*Corresponding author for this work

School of Electrical Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2012
DOIs	https://doi.org/10.1109/EEEI.2012.6377137
State	Published - 2012
Event	2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2012 - Eilat, Israel Duration: 14 Nov 2012 → 17 Nov 2012

Publication series

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

Conference

Conference	2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2012
Country/Territory	Israel
City	Eilat
Period	14/11/12 → 17/11/12

Access to Document

10.1109/EEEI.2012.6377137

Cite this

@inproceedings{1ef2c047193f4ff187bd6ae62c5dd9ce,

title = "Observability of boolean networks is NP-hard",

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.",

author = "Dmitriy Laschov and Michael Margaliot and Guy Even",

year = "2012",

doi = "10.1109/EEEI.2012.6377137",

language = "אנגלית",

isbn = "9781467346801",

series = "2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2012",

booktitle = "2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2012",

note = "null ; Conference date: 14-11-2012 Through 17-11-2012",

}

Laschov, D, Margaliot, M & Even, G 2012, Observability of boolean networks is NP-hard. in 2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2012., 6377137, 2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2012, 2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2012, Eilat, Israel, 14/11/12. https://doi.org/10.1109/EEEI.2012.6377137

Observability of boolean networks is NP-hard. / Laschov, Dmitriy; Margaliot, Michael ; Even, Guy.

2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2012. 2012. 6377137 (2012 IEEE 27th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2012).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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 - פרסום בספר כנס

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

Y2 - 14 November 2012 through 17 November 2012

ER -

Observability of boolean networks is NP-hard

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this