On the algebra of processes III
Let us now assume that the graphs may be infinite. We will however make some finiteness assumptions
which correspond to discrete aspects of the processes.
Consider a cospan of graphs labelled in alphabet A, X ← G → Y. First we will take the alphabet A to be finite. We could make a less drastic assumption but I want to concentrate attention on X, Y, and G.
A consequence of the fact that A is finite is that G breaks up into subgraphs Ga, one for each element a of A, but all with the same vertex set vert(G).
Read more »