Přehled o publikaci

One of the central issues in logical modeling is whether a certain property of the model emerges due to its topological structure (i.e. its influence graph), or due to its dynamical structure (i.e. its logical update functions). In this paper, we practically evaluate a previously proposed formal instrument for studying this question: monotonic model pools and their associated skeleton Boolean networks. Specifically, we propose a simplified over-approximation theorem for skeleton networks and study the emergence of variable stability in these systems. Additionally, we consider the notion of minimal stabilizing interventions and show how to compute such interventions symbolically. We survey the practicality of this methodology on 100+ real-world Boolean networks.