Fig. 8

Transition graph for a dynamical model built under the stories semantics. Transition graph of the asynchronous automata network of Fig. 6, modeling the SBGN-PD map of Fig. 6. 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