Abstract
The definition of a class of resource-deadlock prone Petri nets is developed using first-order predicate calculus. From this definition characteristics of resource deadlock can be ascertained. These characteristics form the specifications of a program to be written in Prolog which can detect deadlock in parallel processes represented as Petri nets. An important feature of this class is that it characterizes deadlock in networks that contain nested parallel structures. Using the class defined herein, it should be possible to derive deadlock-free networks as specified in predicate calculus. Furthermore, this methodology, when applied to systems that do not dynamically determine resources to be allocated, allows for the a priori detection and correction of deadlock. An a priori method prevents the need for unnecessary overhead in dynamic deadlock detection as well as the need for the execution of difficult back-out mechanisms for deadlock correction.
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.
