Identification of free-labeled Petri nets via integer programming

In this paper we deal with the problem of identifying a Petri net system, given a finite language that it generates. In particular, we consider the problem of identifying a free-labeled Petri net system, i.e., a net system where each transition is assigned a unique label. We show that the identification problem can be solved via an integer programming problem. We also discuss how additional structural constraints can be easily imposed to the net.