Abstract

This paper deals with the identification of Petri net systems. The proposed algorithm identifies a Petri net model on the basis of the observed output sequences and of the modifiable input consisting of the enabled controllable transitions set. The main idea is to use the knowledge of the set of enabled controllable transitions together with additional information on the conflicting transitions to accelerate the net identification with respect to the passive identification approaches. In particular, the system assumes that the maximum time that must elapse from the enabling of a transition until it fires is known and that it is possible to detect if the system is entered in a cyclic behavior. Using this additional information, it is possible to determine a set of constraints to represent sequences that are not accepted by the system. Such constraints can be used to improve the net identification. The identification approach proposed in this paper focuses on free labeled Petri net models.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call