Resource Configuration Analysis for a Class of Petri Nets Based on Strongly Connected Characteristic Resource Subnets | Zendy

Miao Liu | Zendy; Zhou He | Zendy; Naiqi Wu | Zendy; Abdulrahman Al-Ahmari | Zendy; Zhiwu Li | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Resource Configuration Analysis for a Class of Petri Nets Based on Strongly Connected Characteristic Resource Subnets

Author(s) -

Miao Liu,

Zhou He,

Naiqi Wu,

Abdulrahman Al-Ahmari,

Zhiwu Li

Publication year - 2017

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.2017.2768069

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

Most existing deadlock prevention studies on flexible manufacturing systems (FMSs) resort to Petri nets (PNs) by designing controllers for them. PNs are an effective tool for analyzing and modeling the dynamic behavior of FMSs. As an important subclass of PNs, the system of simple sequential processes with resources (S³PR) can be used to model many FMSs. This paper proposes a novel resource configuration method based on structural analysis to ensure the liveness of an S³PR. The restrictive relation between the initial marking of the process idle places and a special PN structure called strongly connected characteristic resource sunnets (SCCRSs) is first explored by employing the corresponding relation between SCCRSs and their related strict minimal siphons. With the structural properties of SCCRSs, functions invoked to compute the configuration marking for the resource places in an SCCRS are established. Then, an algorithm for computing a configuration marking in an S³PR is developed, and a resource configuration tree is correspondingly generated according to the execution of the developed algorithm. Thus, the liveness of the configured system is ensured, while the siphon enumerations are avoided. It is shown that the computational complexity of the developed algorithm is polynomial, which is more efficient than other existing ones. Examples are finally provided to illustrate the mentioned results.

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