A Deadlock Prevention Strategy for Petri Nets Through Tuning Time Constraints

• Published in: IEEE access 2024, Vol.12, p.78759-78772
• Main Authors: Zhai, Qianlong, Hu, Xin, El-Sherbeeny, Ahmed M., Li, Zhiwu
• Format: Article
• Language: English
• Subjects: Burning time; deadlock prevention; discrete event system; Discrete event systems; Firing; Graph theory; Petri nets; Prevention; Resource allocation; Resource management; Sequences; System recovery; time constraint; Time factors; Time Petri net; Tuning
• ISSN: 2169-3536; 2169-3536
• DOI: 10.1109/ACCESS.2024.3408637

Deadlocks are of paramount importance in resource allocation systems, which are usually treated from the perspective of discrete event systems. This paper develops a deadlock prevention strategy for a system modeled with Petri nets, by endowing appropriate time constraints with certain transitions to schedule the firing priority of enabled transitions in a Petri net such that transition sequences leading to deadlocks are prohibited, i.e., expanding an untimed Petri net model into a time Petri net to prevent deadlocks. To increase the system permissiveness of a time Petri net with time constraints endowed, a control place is designed, which does not expand the reachable space of the original Petri net. The predominant role of the control place is to convert continuously enabled transitions at certain markings into newly enabled transitions, which can prolong the firing time of transitions. Furthermore, we propose a method that merely enumerates deadlock prevention condition inequalities to derive a series of time constraints by probing the connection between deadlock prevention conditions and transitions. The developed method only needs to designate time constraints for partial transitions. Examples are provided to demonstrate the effectiveness of the presented methodology.