Petri net synthesis
Can we recover a PN from a reachability graph
(or from any flat asynchronous automaton) ?
Can we obtain a canonical representation of a PN accepting a given language ?
(defined as set of transition firing sequences)
Can we minimize a PN with respect to some notion of equivalence ?