Example of a <i>Standard Petri Net</i>.

Abstract

<p>(A) A <i>Petri Net</i> consists of a set of places {<i>p</i><sub>1</sub>, <i>p</i><sub>2</sub>}, set of transitions {<i>t</i><sub>1</sub>, <i>t</i><sub>2</sub>} and an initial marking <i>M</i><sub>0</sub> consisting of one token in place <i>p</i><sub>1</sub>. In this example, the weight of the arcs are not specified so every arc weighs 1. The enabling degree of a transition is determined by number of times a transition can be fired without depositing a token again to the input place of a transition through self-loop. In case of above example <i>t</i><sub>1</sub> is 1 enabled and <i>t</i><sub>2</sub> is 0 enabled from the initial marking <i>M</i><sub>0</sub>. (B) The reachability graph obtained from initial marking <i>M</i><sub>0</sub> of the <i>Petri Net</i>. A reachability graph consist of set of places which can be reached from <i>M</i><sub>0</sub> and arcs which are labelled with enabled transitions. This graph shows one cycle: (1, 0) β†’ (0, 1) β†’ (1, 0) and contains no deadlock. To reach marking <i>M</i><sub>1</sub> = (0, 1) from the marking <i>M</i><sub>0</sub> = (1, 0), a firing sequence <i>S</i> consist of a transition <i>t</i><sub>1</sub> once and transition <i>t</i><sub>2</sub> zero time.</p

    Similar works

    Full text

    thumbnail-image

    Available Versions