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


<p>(A) A <i>SPN</i> consists of a set of places {<i>p</i><sub>1</sub>, <i>p</i><sub>2</sub>, <i>p</i><sub>3</sub>}, set of transitions {<i>t</i><sub>1</sub>, <i>t</i><sub>2</sub>}, rates <i>μ</i><sub>1</sub>, <i>μ</i><sub>2</sub> and an initial marking <i>M</i><sub>0</sub> = (2, 2, 0). In case of this example <i>t</i><sub>1</sub> is 2 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>. (C) The <i>Markov Chain</i> obtained from the reachability graph in (B). Every reachable marking of the <i>SPN</i> is associated with a state of the <i>Markov Chain</i> and a transition between states is labelled with the product of the enabling degree and rate.</p

    Similar works

    Full text


    Available Versions