A new algorithm to compute synchronizing sequences for synchronized Petri nets

In basic testing problems, a topic of great interest is that of state identification. State identification has been solved by the way of synchronizing sequences, i.e., sequences that drive the system to a unique final state regardless of the initial one and do not require the observation of the system´s outputs. In this paper we provide a novel approach for the computation of synchronizing sequences on discrete event systems modeled by synchronized Petri nets. This approach is compared with our previous results for synchronizing sequence computation by means of two different benchmarks. First, we generate random nets, second we provide a parametric manufacturing system.