Work

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.
Institution: Shandong University
Language: English
Open Access status: gold
Estimated APC paid: $1,900
OpenAlex ID: W4405940172
FWCI: 0.116
Cites: 36
Cited by: 1
Related to: 10