Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I am trying to draw a reachability graph for this Petri net. Could you please help me to understand how this works? enter image description here

share|cite|improve this question
You know how Petri nets work? Homework? – Hendrik Jan Jan 16 '13 at 21:34
actually not homework. I'm learning for my exams. – alex Jan 16 '13 at 21:59
Where can we help? Is it the way Petri Nets work, or are you stuck with the reachability graph? – Hendrik Jan Jan 16 '13 at 22:03
reachability graph only. – alex Jan 16 '13 at 22:43
up vote 0 down vote accepted

The nodes of the reachability graph of a Petri net consists of markings of the net, and one connects them with edges that represent the firing of a transition.

In your example start with a node representing the initial marking $(5,0,3,2,0)$. In this marking transition $T0$ taking $1$ from places $P0$ and $P2$ each, while adding $1$ to place $P1$. The resulting marking is $(4,1,2,2,0)$. Add an edge labelled by $T0$ from the first to second marking.

In the same initial marking also $T2$ is enabled, add an edge to the marking that results after firing. Continue this way, visiting the newly generated markings, until all possibilities are taken care of.

If the net is bounded, the number of reachable markings is finite, and your construction finishes in a finite number of steps.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.