Fig. 7

Transition graph for a dynamical model built under the general semantics. Transition graph of the asynchronous automata network of Fig. 3, modeling the SBGN-PD map of Fig. 3. Each node represents a global state of the asynchronous automata network. There is a directed edge from a state S to a state S ^′ iff S ^′ is reachable from S. Circled states are point attractors. States colored in blue are all states present in the transition graph of the asynchronous automata network modeling the same map under the stories semantics (Fig. 8)