List of Figures

• 2.1 Three programmers sharing two terminals (terminal.pnt)
• 2.2 Dining philosophers (dinner.cnt)
• 5.1 A net containing a transition without pre-places (red_simp.pnt)
• 5.2 A net with two parallel places and transitions (reduce_f.pnt)
• 5.3 Reductions with respect to parallel nodes of the example net 5.2
• 5.4 A net with equivalent places and their reduction (reduce_m.pnt)
• 5.5 A net which is reducible with <A> and the result (reduce_a.pnt)
• 5.6 A net which is reducible with <B> and the result (reduce_b.pnt)
• 5.7 A net with a reducible looping place (reduce_c.pnt)
• 5.8 A net with a reducible loop (reduce_u.pnt)
• 5.9 A net which is reducible with <V> (reduce_v.pnt)
• 5.10 Reduction of Example net 5.9
• 5.11 A net which is reducible with <W> and the result (reduce_w.pnt)
• 6.1 A net in which one place is not markable (stateeq.pnt)
• 6.2 Two traffic lights (ampel.pnt)
• 6.3 The alternating bit protocol (altbit.pnt)
• 6.4 Three strongly connected state machines components of the net 6.2