Abstract
Resource-transition circuits (RTCs) and siphons are related to the deadlock problem and liveness control problem in Petri net models of automated manufacturing systems. This paper will concentrate on a particular type of Petri nets called systems of sequential processes with resources (S3PRs) and solves the RTC and siphon enumeration problems. A graph-based technique is first used to find all elementary RTC structures. Any RTC can be expressed as a union of some elementary RTCs. Then, an iterative method is developed to recursively construct all maximal perfect-resource-transition circuits (MPCs), which can lead the system to deadlock, from the elementary RTCs. Finally, by the one-to-one correspondence between strict minimal siphons and MPCs, a new algorithm is obtained to compute strict minimal siphons in S3PRs.
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.
