// Date:  2018-08-02
// Author: schaetzc@tf.uni-freiburg.de
//
// Petri Net n. 
//
//   (0)--[a]->(1)--[c]->(2)
//    `---[b]--^

assert(accepts(n, [a c]));
assert(accepts(n, [b c]));
assert(!accepts(n, []));
assert(!accepts(n, [a b c]));

print(finitePrefix(n));

PetriNet n = (
  alphabet = {a b c},
  places = {p0 p1 p2},
  transitions = {
    ({p0} a {p1})
    ({p0} b {p1}) 
    ({p1} c {p2})
  },
  initialMarking = {p0},
  acceptingPlaces = {p2}
);