Robust reachability of Boolean control networks with arbitrary disturbance inputs
Year: 2024
Type: article
Abstract: This paper investigates the robust reachability of Boolean control networks (BCNs) with arbitrary disturbance inputs. First, in order to describe the dynamics of a BCN with arbitrary disturbance inputs, a new concept, possible reachability, is introduced. By exploring the relationship between the robust reachability and the transition matrix, a necessary and sufficient condition is derived for checking the robust reachability. Subsequently, the dynamic progress graph is introduced to describe the dynamics of BCNs and based on the breadth-first search (BFS), an algorithm is proposed to design the shortest control input sequence to ensure robust reachability.
Source: Franklin Open
Institution: Shandong University
Language: English
Subfield: Molecular Biology
Domain: Life Sciences
Open Access status: gold
Estimated APC paid: $1,900
Awards: G1313194176, G1876799799, G3192537812
OpenAlex ID: W4405940172
