Abstract
Unfoldings of Petri nets (PN) provide a method for the analysis of concurrent systems without restoring the state space of a system. This allows one to overcome the “state explosion” problem. Many properties of the initial PN (boundedness, safety, persistency and hazards) can be checked by constructing the unfolding. A deadlock prevention procedure first detects deadlocks using an unfolding. Then, the first method reduces the unfolding to a set of deadlock-free subunfoldings that cover all live behaviours. The second method uses a direct transformation at the level of the original PN. The methods are implemented as subroutines in the Berkeley program SIS. Although the deadlock detection problem is known to be NP-complete, experimental results show that for highly parallel specifications deadlock prevention by unfoldings is typically more efficient than deadlock prevention based on symbolic BDD (binary decision diagrams) traversal of the corresponding reachability graph.
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 callMore From: The International Journal of Advanced Manufacturing Technology
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.
