Synchronizing sequences on a class of unbounded systems using synchronized Petri nets

Determining the state of a system when one does not know its current initial state is a very important problem in many practical applications as checking communication protocols, part orienteers, digital circuit reset, etc. Synchronizing sequences have been proposed in the 60’s to solve the problem on systems modeled by finite state machines. This paper presents a first investigation of the synchronizing problem on unbounded systems, using synchronized Petri nets, i.e., nets whose evolution is driven by external input events. The proposed approach suffers from the fact that no finite space representation can exhaustively answer to the reachability problem but we show that synchronizing sequences may be computed for a particular class of unbounded synchronized Petri nets.