Supervisor Synthesis for Enforcing a Disjunction of GMECs on Controlled Petri Nets

Author(s):  
Jiliang Luo ◽  
Shouguang Wang
Author(s):  
Jiliang Luo

An algorithm is proposed to equivalently transform original linear constraints on Petri nets, where the uncontrollable subnets are forward-concurrent free nets, into admissible ones. Consequently, this algorithm can be used to design both efficient and optimal supervisors for enforcing linear constraints on Petri nets since the problem on how to enforce admissible constraints has been well solved. Further, the supervisor synthesis procedure is presented using this algorithm. Lastly, it is illustrated by an example where an optimal supervisor is designed for a flexible manufacturing system.


2016 ◽  
Vol 2016 ◽  
pp. 1-12 ◽  
Author(s):  
YiFan Hou ◽  
Mi Zhao ◽  
Ding Liu ◽  
Liang Hong

We propose a new deadlock prevention policy for an important class of resource allocation systems (RASs) that appear in the modeling of flexible manufacturing systems (FMSs). The model of this class in terms of generalized Petri nets is, namely, S4PR. On the basis of recent structural analysis results related to the elementary siphons in generalized Petri nets on one hand and an efficient deadlock avoidance policy proposed for the class of conjunctive/disjunctive (C/D) RASs on the other hand, we show how one can generate monitors to be added to a net system such that all its strict minimal siphons aremax′-controlled and no insufficiently marked siphon is generated. Thereby, a new, simple, and more permissive liveness-enforcing supervisor synthesis method for S4PR is established.


Sign in / Sign up

Export Citation Format

Share Document