In[]:=
RandomGraph[{4,8},DirectedEdgesTrue]
Out[]=
In[]:=
AdjacencyGraph[RandomInteger[1,{4,4}]]
Out[]=
From the moves on this graph, we can derive a multiway system
[ Are the transitions in a Petri net important ? ] [ Yes, e.g. as filters for tokens moving from multiple places to a single place ]
Reachability: given a Petri and “marking” (i.e. a token configuration), is this reachable?
State of a Petri net: number of tokens at each node....
At each step, you can either move a token or not....
In[]:=
EdgeList
Out[]=
{13,21,31,34,42,43}
In[]:=
Rule@@@%
Out[]=
{13,21,31,34,42,43}
Each ij says to decrement the element at i and increment the one at j, probably not doing it if i=0...