By Topic

Synthesis of deadlock prevention supervisors using Petri nets

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Iordache, M.V. ; Dept. of Electr. Eng., Notre Dame Univ., IN, USA ; Moody, J.O. ; Antsaklis, P.J.

Given an arbitrary Petri net (PN) structure, which may have uncontrollable and unobservable transitions, the deadlock prevention procedure presented here determines a set of linear inequalities on the PN markings. When the PN is supervised so that its markings satisfy these inequalities, the supervised net is proved to be deadlock-free for all initial markings that satisfy the supervision constraints. Deadlock-freedom implies that there will always be at least one transition that is enabled in the closed-loop (supervised) system. The method is not guaranteed to ensure liveness, as it can be applied to systems that cannot be made live under any circumstances. However, for controllable and observable PNs, it is shown that, when the method ensures liveness as well, the liveness-ensuring supervisor is least restrictive. Moreover, it is shown that the method is not restrictive even for PNs in which not all transitions can be made live. The procedure allows automated synthesis of the supervisors

Published in:

Robotics and Automation, IEEE Transactions on  (Volume:18 ,  Issue: 1 )