Basic Examples (3) 

Construct a simple Petri net from lists of four places, three transitions and eight arcs, with an initial distribution of six tokens:

In[1]:=

Out[1]=

Evaluate one step in the multiway evolution of this Petri net:

In[2]:=

Out[2]=

Evaluate the first three steps in the multiway evolution of this Petri net:

In[3]:=

Out[3]=

Show the set of labeled graphs obtained after one step, with every possible transition firing highlighted:

In[4]:=

Out[4]=

Show the set of labeled graphs obtained after one step, but without any transition firings highlighted:

In[5]:=

Out[5]=

Show the sets of labeled graphs after three steps, without any transition firings highlighted:

In[6]:=

Out[6]=

Evolve a Petri net (representing a reversible chemical reaction) specified by an association of three places, two transitions and six arcs, with an initial distribution of twelve tokens, for three steps:

In[7]:=

Out[7]=

Show the lists of token numbers obtained after each of the three steps:

In[8]:=

Out[8]=

Show the lists of token numbers obtained after each of the three steps, along with the corresponding transition firings:

In[9]:=

Out[9]=

Show the sets of labeled graphs obtained after two steps, with every possible transition firing highlighted:

In[10]:=

Out[10]=

Show the sets of weighted graphs obtained after two steps, with every possible transition firing highlighted:

In[11]:=

Out[11]=

Show the sets of weighted graphs obtained after two steps, but without any transition firings highlighted:

In[12]:=

Out[12]=

Evolve a more complicated Petri net representing a concurrent communications protocol between two agents (specified as lists of places, transitions, arcs and tokens) for two steps:

In[13]:=

Out[13]=

Show the lists of token numbers obtained after each of the two steps, along with the corresponding transition firings:

In[14]:=

Out[14]=

Scope (2) 

If PetriNetMultiwayEvolution is called without an explicit list of token numbers, it is assumed that each place contains no tokens:

In[15]:=

Out[15]=

Construct a Petri net representing a simple producer-consumer problem in concurrency theory:

In[16]:=

Out[16]=

Show the list of Petri net objects obtained after two steps of multiway evolution:

In[17]:=

Out[17]=

Show the list of directed graph representations (with token counts represented graphically) after two steps of multiway evolution:

In[18]:=

Out[18]=

Show the list of directed graph representations (with token counts represented graphically, and with transition firings highlighted) after two steps of multiway evolution:

In[19]:=

Out[19]=

Show the list of directed graph representations (with token counts represented as vertex weights) after two steps of multiway evolution:

In[20]:=

Out[20]=

Show the list of directed graph representations (with token counts represented as vertex weights, and with transition firings highlighted) after two steps of multiway evolution:

In[21]:=

Out[21]=

Show the list of token numbers associated to each place after each firing, following two steps of multiway evolution:

In[22]:=

Out[22]=

Show the list of token numbers associated to each place after each firing (with the corresponding transition firings specified), following two steps of multiway evolution:

In[23]:=

Out[23]=

Options (1) 

PetriNetMultiwayEvolution supports the same options as Graph:

In[24]:=

Out[24]=

In[25]:=

Out[25]=