Computer Science – Discrete Mathematics
Scientific paper
2011-04-20
Computer Science
Discrete Mathematics
Scientific paper
This article shows how for most networks (more precisely, for all networks except some of the networks that satisfy severe necessary conditions), synchronous updates of the states of automata only add shortcuts in the asynchronous/sequential trajectories of the network. Further, as a consequence, the recurrent configurations of most networks remain recurrent when synchronism in the updates is added so that the asymptotic dynamics of the network does not change drastically with this addition of synchronism.
No associations
LandOfFree
Synchronism vs Asynchronism in Boolean networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Synchronism vs Asynchronism in Boolean networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Synchronism vs Asynchronism in Boolean networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-432975