Abstract

Elementary siphons are important concepts in Petri net theory. Based on them, effective deadlock control can be developed for a net system. The research shows that different sets of elementary siphons have different effects in terms of reachable states using a same control synthesis method. This paper illustrates an algorithm, which can find an optimal set of elementary siphons in polynomial time given all siphons. Its use produces more reachable states of the controlled net than other ones do when a same deadlock control policy is applied. Our research starts with theoretical results and ends with experimental ones

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 call

Disclaimer: 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.