activity
20142026
most citedA Polynomial-Time Algorithm for Solving the Minimal Observability Problem in Conjunctive Boolean Networks

57 citations · 336 across the 51 of their papers we have counts for

collaborators
Showing 2018 · math.OCShow all

1 paper · 2 filters

math.OC2018★ 21 cited

Output Selection and Observer Design for Boolean Control Networks: A Sub-Optimal Polynomial-Complexity Algorithm

Eyal Weiss, Michael Margaliot

Using a graph-theoretic approach, we derive a new sufficient condition for observability of a Boolean control network (BCN). Based on this condition, we describe two algorithms: th…