A Polynomial-Time Algorithm for Solving the Minimal Observability Problem in Conjunctive Boolean Networks

DOI10.1109/TAC.2018.2882154zbMath1482.93085arXiv1706.04072MaRDI QIDQ5223786

Eyal Weiss, Michael Margaliot

Publication date: 18 July 2019

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1706.04072

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Random graphs (graph-theoretic aspects) (05C80) Controllability (93B05) Discrete-time control/observation systems (93C55) Decentralized systems (93A14)

Related Items (9)

On quotients of Boolean control networks ⋮ Minimal observability of Boolean control networks ⋮ Fault detection and pinning control of Boolean networks ⋮ A survey on observability of Boolean control networks ⋮ Bisimulations of Probabilistic Boolean Networks ⋮ Finite-time pinning stabilization of Markovian jump Boolean networks ⋮ Distributional observability of probabilistic Boolean networks ⋮ Complex systems with impulsive effects and logical dynamics: a brief overview ⋮ Reduction and Analysis of Boolean Control Networks by Bisimulation

This page was built for publication: A Polynomial-Time Algorithm for Solving the Minimal Observability Problem in Conjunctive Boolean Networks