Towards the Existential Control of Boolean Networks: A Preliminary Report (Extended Abstract)
For researchers studying Boolean network dynamics, this is an incremental method that may improve efficiency on modular networks, but no implementation or validation is provided.
The paper addresses the problem of finding a minimal set of vertices to control transitions between attractors in Boolean networks, proposing a decomposition-based method that computes control locally for strongly connected components and merges results. No concrete results or numbers are reported.
Given a Boolean network BN and a subset A of attractors of BN, we study the problem of identifying a minimal subset C of vertices of BN, such that the dynamics of BN can reach from a state s in any attractor As in A to any attractor At in A by controlling or toggling a subset of vertices in C in a single time step. We describe a method based on the decomposition of the network structure into strongly connected components called blocks. The control subset can be locally computed for each such block and the results then merged to derive the global control subset C. This potentially improves the efficiency for many real-life networks that are large but modular and well-structured. We are currently in the process of implementing our method in software.