Cellular Signaling for Communication Networks
■
467
internal states of dynamical networks, theoretical computer science can be used
as the basis. Cellular automata, graph automata (in their classical definition),
Petri nets, etc., are suitable to formulate the dynamical processes of updating
the graph’s states in a connectionist way. Recently, Sayama proposed a model
called GNA [10] that integrates the graph formation processes represented in terms
of state transitions with the operations on the topological structure of dynamical
networks.
So, we now extend the notation for a set of dynamical networks Gbased on graph
theory as follows:
G =
V, E, S, Q, M
(18.8)
where
V is the set of vertices
E is the set of edges
S is the set of states of the network
Q is