Identification of Petri nets using timing information

This paper deals with the identification problem for deterministic timed Petri net systems. The proposed algorithm identifies a timed Petri net starting from the observed timed sequences. The main idea is to use the timing information to accelerate the net identification with respect to the untimed approaches. In particular, exploiting the timing it is possible to determine a set of counterexamples, i.e., a set of strings that do not belong to the language, that can be used to improve the net identification. The identification approach proposed in this paper focuses on free labeled timed Petri nets.