// Date:  2018-05-15
// Author: schaetzc@tf.uni-freiburg.de

print(finitePrefix(n));

PetriNet n = (
  alphabet = {a b c d e f},
  places = {p0 p1 p2 p3 p4 p5 p6},
  transitions = {
    ({p0} a {p1 p2})
    ({p0} b {p2 p3})
    ({p0} c {p3 p4}) 
    ({p0} d {p5}) 
    ({p1} e {p6})
    ({p2 p3} f {p6})
  },
  initialMarking = {p0},
  acceptingPlaces = {p6 p4}
);