scholarly journals Designing Reversibility-Enforcing Supervisors of Polynomial Complexity for Bounded Petri Nets Through the Theory of Regions

2006 ◽  
pp. 322-341 ◽  
Author(s):  
Spyros A. Reveliotis ◽  
Jin Young Choi
Keyword(s):  
Petri Nets ◽  
Polynomial Complexity

scholarly journals A Multistep Look-Ahead Deadlock Avoidance Policy for Automated Manufacturing Systems

2017 ◽  
Vol 2017 ◽  
pp. 1-16 ◽  
Author(s):  
Chao Gu ◽  
Zhiwu Li ◽  
Abdulrahman Al-Ahmari
Keyword(s):  
Petri Nets ◽  
Manufacturing Systems ◽  
Polynomial Complexity ◽  
Deadlock Avoidance ◽  
Automated Manufacturing ◽  
Automated Manufacturing Systems ◽  
Look Ahead ◽  
Unit Capacity ◽  
Automated Manufacturing System ◽  
Intractable Problem

For an automated manufacturing system (AMS), it is a computationally intractable problem to find a maximally permissive deadlock avoidance policy (DAP) in a general case, since the decision on the safety of a reachable state is NP-hard. This paper focuses on the deadlock avoidance problem for systems of simple sequential processes with resources (S3PR) by using Petri nets structural analysis theory. Inspired by the one-step look-ahead DAP that is an established result, which is of polynomial complexity, for an S3PR without one-unit-capacity resources shared by two or more resource-transition circuits (in the Petri net model) that do not include each other, this research explores a multiple-step look-ahead deadlock avoidance policy for a system modeled with an S3PR that contains a shared one-unit-capacity resource in resource-transition circuits. It is shown that the development of an optimal DAP for the considered class of Petri nets is also of polynomial complexity. It is indicated that the steps needed to look ahead in a DAP depend on the structure of the net model. A number of examples are used to illustrate the proposed method.

Sign in / Sign up

Export Citation Format

Share Document