// Date:  2018-08-02
// Author: schaetzc@tf.uni-freiburg.de

PetriNet result = removeUnreachable(n);
assert(numberOfPlaces(result) == 0);
assert(numberOfTransitions(result) == 0);
assert(isEmpty(result));


PetriNet n = (
  alphabet = {a},
  places = {pDead},
  transitions = {
  },
  initialMarking = {},
  acceptingPlaces = {pDead}
);