Abstract
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 on 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, in particular synchronized Petri nets are taken into account. The proposed approach suffers from the fact that no finite space representation can exhaustively answer to the reachability problem. This problem is shown to be solved for some particular semantics.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
