This preview shows page 1. Sign up to view the full content.
Unformatted text preview: b) Map the state transitions in the system. Start with an initial state, and update the state of the nodes for a sucient number of steps for determining the attractor. Then start from a state that was not encountered yet, and repeat until all states were considered. Draw a state transition network in which the nodes are the states of the system and the directed edges mean that the state at the end of the edge follows from the state at the beginning of the edge by updating the nodes once. How many attractors does the network have? Extra credit: Do point b), or part of it, using the software library Boolean-Net: http://code.google.com/p/booleannet/ Tip: Start with reviewing the tutorials in BooleanNet. 1...
View Full Document
This document was uploaded on 03/01/2011.
- Fall '09