World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

ON THE LIMIT CYCLE STRUCTURE OF THRESHOLD BOOLEAN NETWORKS OVER COMPLETE GRAPHS

    https://doi.org/10.1142/S0129065704001942Cited by:2 (Source: Crossref)

    In previous work, the limit structure of positive and negative finite threshold boolean networks without inputs (TBNs) over the complete digraph Kn was analyzed and an algorithm was presented for computing this structure in polynomial time. Those results are generalized in this paper to cover the case of arbitrary TBNs over Kn. Although the limit structure is now more complicated, containing, not only fixed-points and cycles of length 2, but possibly also cycles of arbitrary length, a simple algorithm is still available for its determination in polynomial time. Finally, the algorithm is generalized to cover the case of symmetric finite boolean networks over Kn.

    AMSC: Primary 93A05, Primary 92B20, Secondary 68-04