Abstract
Deadlock detection is one of the important problems of analysis of discrete parallel systems. There is an efficient method of deadlock detection in Petri nets known as the stubborn set method. It cannot be directly used for the interpreted Petri nets; such net and its underlying Petri net may have different sets of deadlocks. In the article a method of deadlock detection for the generalized parallel discrete systems is presented with the theoretical results proving its correctness; concretization of the method for the interpreted Petri nets and sequent automata is proposed.
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.
