Abstract
In this paper, the problem of designing large-scale Boolean networks with prescribed attractors is considered. The obtained Boolean networks satisfy the attractor constraints, as well as that the size of the basins of attraction (BOAs) of desired attractors is at its maximum. This is achieved by network aggregation, under which desired attractors and undesired attractors can be mapped to input-state cycles in the subnetworks. The input-state cycles corresponding to desired attractors must be contained in subnetworks, and for each undesired attractor at least one input-state cycle is not contained. An algorithm is proposed to maximize the size of the BOAs of desired attractors. Finally, a practical example is given to illustrate the effectiveness of the proposed methods.
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 callMore From: International Journal of Control, Automation and Systems
Disclaimer: 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.
