Deadlock prevention policy with behavioral optimality or suboptimality achieved by the redundancy identification of constraints and the rearrangement of monitors
Summary: This work develops an iterative deadlock prevention method for a special class of Petri nets that can well model a variety of flexible manufacturing systems. A deadlock detection technique, called mixed integer programming (MIP), is used to find a strict minimal siphon (SMS) in a plant model without a complete enumeration of siphons. The policy consists of two phases. At the first phase, SMSs are obtained by MIP technique iteratively and monitors are added to the complementary sets of the SMSs. For the possible existence of new siphons generated after the first phase, we add monitors with their output arcs first pointed to source transitions at the second phase to avoid new siphons generating and then rearrange the output arcs step by step on condition that liveness is preserved. In addition, an algorithm is proposed to remove the redundant constraints of the MIP problem in this paper. The policy improves the behavioral permissiveness of the resulting net and greatly enhances the structural simplicity of the supervisor. Theoretical analysis and experimental results verify the effectiveness of the proposed method.
- Designing Optimal Deadlock Avoidance Policies for Sequential Resource Allocation Systems Through Classification Theory: Existence Results and Customized Algorithms
- Deadlock prevention policy based on Petri nets and siphons
- Polynomial-complexity deadlock avoidance policies for sequential resource allocation systems
- Supervisor reconfiguration for deadlock prevention by resources reallocation
- Prevention of deadlocks in parallel programs of multiprocessor machines
- Revisiting deadlock prevention: a probabilistic approach
- Deadlock prevention with collectively occupied resources
- Generalized Algebraic Deadlock Avoidance Policies for Sequential Resource Allocation Systems
- Designing Compact and Maximally Permissive Deadlock Avoidance Policies for Complex Resource Allocation Systems Through Classification Theory: The Linear Case
- A technique of state space search based on unfolding
- Deadlock avoidance in sequential resource allocation systems with multiple resource acquisitions and flexible routings
- Deadlock prevention policy based on Petri nets and siphons
- Design of a maximally permissive liveness-enforcing supervisor with a compressed supervisory structure for flexible manufacturing systems
- Design of Optimal Petri Net Controllers for Disjunctive Generalized Mutual Exclusion Constraints
- scientific article; zbMATH DE number 4045165 (Why is no real title available?)
- On structural minimality of optimal supervisors for flexible manufacturing systems
- Suboptimal liveness-enforcing supervisor design for a class of generalised Petri nets using partial siphon enumeration and mathematical programming
- One novel and optimal deadlock recovery policy for flexible manufacturing systems using iterative control transitions strategy
- Supervisor reconfiguration for deadlock prevention by resources reallocation
- An iterative method for synthesizing non-blocking supervisors for a class of generalized Petri nets using mathematical programming
- Non-blocking supervisory design using mixed integer programming
- Computationally improved optimal control methodology for linear programming problems of flexible manufacturing systems
- scientific article; zbMATH DE number 1836363 (Why is no real title available?)
- Structure reduction of liveness-enforcing Petri nets using mixed integer programming
This page was built for publication: Deadlock prevention policy with behavioral optimality or suboptimality achieved by the redundancy identification of constraints and the rearrangement of monitors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1723403)
