Deadlock Prevention Policy for S4PR Nets Based on Siphon | Zendy

Qiaoli Zhuang | Zendy; Wenzhan Dai | Zendy; Shouguang Wang | Zendy; Fan Ning | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Deadlock Prevention Policy for S⁴PR Nets Based on Siphon

Author(s) -

Qiaoli Zhuang,

Wenzhan Dai,

Shouguang Wang,

Fan Ning

Publication year - 2018

Publication title -

ieee access

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.587

H-Index - 127

ISSN - 2169-3536

DOI - 10.1109/access.2018.2868981

Subject(s) - aerospace , bioengineering , communication, networking and broadcast technologies , components, circuits, devices and systems , computing and processing , engineered materials, dielectrics and plasmas , engineering profession , fields, waves and electromagnetics , general topics for engineers , geoscience , nuclear engineering , photonics and electrooptics , power, energy and industry applications , robotics and control systems , signal processing and analysis , transportation

Computational efficiency and behavioral permissiveness are important criteria for evaluating the performance of deadlock control strategies. How to achieve an effective tradeoff between these criteria is a hot research topic in the field of deadlock prevention. Toward this end, a new iterative deadlock prevention policy based on mixed integer programming is proposed for a class of Petri nets called systems of sequential systems with shared resources (S⁴PR) nets. In each iteration, a minimal bad siphon is first calculated using the new approach, and a monitor is then designed to forbid all S'-bad markings that turn the siphon S into a bad siphon. The algorithm terminates when no bad siphon is detected. The resultant system derived from the proposed approach has more permissive behavior compared with that derived from existing policies. Furthermore, optimal controlled systems can be obtained for some S⁴PR nets. Moreover, the computational efficiency of the algorithm is low because computation of the reachability graph and complete siphon enumeration are avoided.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research