A MATHEMATICAL PROGRAMMING APPROACH FOR THE IDENTIFICATION OF TIMED PETRI NETS

In this paper, we propose to synthesize timed Petri nets from structural and behavioural constraints. The identification problem is expressed as an integer linear programming problem, where unknows correspond to the structure of the Petri net. Using such a model, one can identify the components of the Petri Net incidence matrices as well as the durations associated to timed transitions. An objective function can be used to optimize these durations in order to obtain a model minimizing the duration of a particular firing sequence.