Petri nets are a grahical method of illustrating the states of a machine or computation. There are two types of nodes. One type represetned states and the other transitions. In addition state nodes may carry markers. Only when all the input state nodes joined to a transition are fully marked does the transition fire. The states beyond the transition may then become marked.