Identification of Time Petri Net Models
Francesco Basile, Pasquale Chiacchio, Jolanda Coppola · IEEE Transactions on Systems Man and Cybernetics Systems · 2016
This paper deals with the identification of time Petri net systems. An identification algorithm for timed net systems must take into account that the firing of a transition requires not only that the enabling condition is met, as in untimed net systems, but it is also required that the firing interval of a transition is congruent with the observed firing instant times. The key idea behind the approach is to express these conditions by a set of logical propositions that can be directly transformed into linear mixed-integer inequalities. The identification algorithm consists of building the logical propositions from the observed behavior and solving a mixed-integer linear programming problem.