Abstract
This paper investigates the one-bit function perturbation (OBFP) impact on the robust set stability of Boolean networks with disturbances (DBNs). Firstly, the dynamics of these networks are converted into the algebraic forms utilizing the semi-tensor product (STP) method. Secondly, OBFP’s impact on the robust set stability of DBNs is divided into two situations. Then, by constructing a state set and defining an index vector, several necessary and sufficient conditions to guarantee that a DBN under OBFP can stay robust set stable unchanged are provided. Finally, a biological example is proposed to demonstrate the effectiveness of the obtained theoretical results.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
