World Scientific
  • Search
  •   
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 [email protected] for any enquiries.

Classes of states of discrete systems

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

    We present a method which allows for a reduction of a size of a simulated system. The method can be applied to any system where one can define a finite set of possible states of the system and an elementary process which transforms one state of the system to another. The method is based on the system symmetry; we get classes of states, which can be used instead of states. A detailed procedure is presented for undirected/directed and/or unweighted/weighted graphs. Several applications of the method are shown for different types of systems. In particular, new results are presented for the random Boolean networks.

    PACS: 89.75.-k, 05.10.-a

    References

    You currently do not have access to the full text article.

    Recommend the journal to your library today!