Abstract

A conjunctive Boolean network (CBN) is a discrete-time finite state dynamical system, whose variables take values from a binary set, and the value update rule for each variable is a Boolean function consisting only of logic AND operations. Since a CBN is a finite state dynamical system, every trajectory generated by the system will enter a periodic orbit. We characterize in this paper the asymptotic behavior of a special class of weakly connected CBNs where the strongly connected components of their dependency graphs are all cycles of positive lengths. Given an initial condition of such a CBN, we characterize a periodic orbit which the system enters with the given initial condition.

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 call

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.