The state of a Petri net, called its marking M, is characterized by the tokens
at each place-node P; the initial state of a Petri net is a specified initial
marking M0. A Petri net makes transitions from one state to another based
upon firing rules associated with the transition-nodes: if each input place-node
of a transition-node contains a token, then the transition-node is eligible to fire.