Identification of unbounded Petri nets from their coverability graph

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

[1]  E. Lopez-Mellado,et al.  Required event sequences for identification of Discrete Event Systems , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[2]  G. Nemhauser,et al.  Integer Programming , 2020 .

[3]  C. Seatzu,et al.  Identification of deterministic Petri nets , 2006, 2006 8th International Workshop on Discrete Event Systems.

[4]  Kunihiko Hiraishi.  Construction of a Class of Safe Petri Nets by Presenting Firing Sequences , 1992, Application and Theory of Petri Nets.

[5]  Philippe Darondeau,et al.  Theory of Regions , 1996, Petri Nets.

[6]  Richard M. Karp,et al.  Parallel Program Schemata , 1969, J. Comput. Syst. Sci..

[7]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[8]  C. Seatzu,et al.  Identification of free-labeled Petri nets via integer programming , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.