Determining the most realistic update schedule for Boolean automata networks

Determine which deterministic update schedule for Boolean automata networks most realistically models the dynamics of gene regulatory mechanisms, selecting among established schedule families—parallel, sequential, block-sequential, periodic, deterministic, and block-parallel—based on clearly defined modeling criteria and empirical or theoretical evidence.

Background

Boolean automata networks (BANs) are widely used to model gene regulatory systems, where the choice of update schedule critically impacts the resulting dynamics, attractors, and fixed points. The literature includes multiple deterministic schedules with varying expressivity, including parallel, sequential, block-sequential, periodic, and block-parallel schedules, with a formal hierarchy established via simulation relationships.

Despite substantial paper of update schedules, there is no consensus on which schedule best captures realistic biological timing and concurrency in gene regulation. The authors highlight that debates remain unresolved, motivating rigorous criteria and comparative analyses to identify a schedule that aligns with biological plausibility while preserving key dynamical properties.