Identification of unbounded Petri nets from their coverability graph
Maria Paola Cabasino, Alessandro Giua, Carla Seatzu · 2006
We solve the following problem: given an automaton that represents the coverability graph of a net, determine a net system whose coverability graph is isomorph to the automaton. Our approach requires solving an integer programming problem whose set of unknowns contains the elements of the pre and post incidence matrices and the initial marking of the net