<p>A token passing network is a directed graph with a designated input node and a designated output node. The input node has no incoming edges whereas the output node has no outgoing edges. Also the input node generates a sequence of tokens, labelled 1, 2, 3, ... . These tokens are passed on to the nodes within the graph, where each node, apart from the input and output node, can hold at most one token at any time. The edges do not hold tokens but are there to pass them on. The following must hold if a token <span class="SimpleMath">\(t\)</span> moves from the node <span class="SimpleMath">\(x\)</span> to the node <span class="SimpleMath">\(y\)</span>.</p>
<p>There is an edge from <span class="SimpleMath">\(x\)</span> to <span class="SimpleMath">\(y\)</span>; <span class="SimpleMath">\(x\)</span> is the input node, and the tokens 1, 2, 3, ... , <span class="SimpleMath">\(t-1\)</span> have been moved, or <span class="SimpleMath">\(x\)</span> is any other node but not the output node; lastly either <span class="SimpleMath">\(y\)</span> is the output node or <span class="SimpleMath">\(y\)</span> is not the input node and currently is not occupied by a token. <a href="chapBib_mj.html#biBPermGenTPGraph">[ALTnd]</a></p>
<p>Token passing networks, or TPNs, are represented in <strong class="pkg">GAP</strong> as a list. Each entry of the list is the index of the node within the TPN and contains a list of the "destinations", i.e. the end of the edge or arrow where it is directed to.</p>
<p>Here is an example how the input of such a TPN looks in <strong class="pkg">GAP</strong>:</p>
<p>This list represents the following directed graph: <br><center><img src="img/hex.jpg" WIDTH=243 HEIGHT=98 ></center><br> From this it is visible that the input node is 1, as it has no other node pointing any arrows towards it, and the output node is 6, as it has no destinations (hence the empty list).</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ Parstacks</code>( <var class="Arg">m</var>, <var class="Arg">n</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Returns: A list that represents the directed edges of a token passing network.</p>
<p><code class="code">Parstacks</code> constructs a token passing network with 2 different sized stacks <code class="code">m,n</code> positioned in parallel.</p>
<p><code class="code">Parstacks(2,2)</code> can be visualised as the following directed graph: <br><center><img src="img/ps22.jpg" WIDTH=244 HEIGHT=282 ></center><br></p>
<p>The token passing network below represents the list that was output by <code class="code">Parstacks(4,3)</code>. <br><center><img src="img/ps43.jpg" WIDTH=242 HEIGHT=458 ></center><br></p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ Seqstacks</code>( <var class="Arg">n</var>[, <var class="Arg">m</var>[, <var class="Arg">o</var>[, <var class="Arg">p</var>[, <var class="Arg">...</var>]]]] )</td><td class="tdright">( function )</td></tr></table></div>
<p>Returns: A list that represents the directed edges of a token passing network.</p>
<p>The token passing network build by <code class="code">Seqstacks</code> contains a series of stacks (as many as you have integers in the arguments list) each of different length (each integer in the argument list).</p>
<p><code class="code">Seqstacks(2,2)</code> can be visualised as the following directed graph: <br><center><img src="img/ss22.jpg" WIDTH=281 HEIGHT=130 ></center><br></p>
<p>The token passing network containing a series of stacks of length 3, 1 and 4 looks as follows: <br><center><img src="img/ss314.jpg" WIDTH=321 HEIGHT=234 ></center><br></p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ BufferAndStack</code>( <var class="Arg">m</var>, <var class="Arg">n</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Returns: A list that represents the directed edges of a token passing network.</p>
<p><code class="code">BufferAndStack</code> is a token passing network that consists of a buffer of size <code class="code">m</code> which is followed by a single stack of size <code class="code">n</code>.</p>
<p><code class="code">BufferAndStack(2,2)</code> is the following directed graph: <br><center><imgsrc="img/bs22.jpg" WIDTH=308 HEIGHT=132 ></center><br></p>
<p>The token passing network correlating to the list output by <code class="code">BufferAndStack(4,3)</code> is: <br><center><img src="img/bs43.jpg" WIDTH=303 HEIGHT=253 ></center><br></p>
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung ist noch experimentell.
