Identification in discrete event systems

This paper presents a method to identify discrete event systems (DES) using interpreted Petri nets (IPN). The approach herein proposed works online with the system and has two main steps. In the first step, the algorithm advances finding out new places, transitions and arcs, all of them are obtained using input-output information. In the second step, the algorithm goes back over the last output sequence computing constraints and no observable places. The algorithm is an infinity loop and is always reading and processing DES information. Properties like observability and identifiability will be addressed.