Name
Title | ||
|---|---|---|
Resource Configuration Analysis for a Class of Petri Nets Based on Strongly Connected Characteristic Resource Subnets. |
Abstract | ||
|---|---|---|
Most existing deadlock prevention studies onexible 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 ((SPR)-P-3) can be used to model many FMSs. This paper proposes a novel resource conguration method based on structural analysis to ensure the liveness of an (SPR)-P-3. The restrictive relation between the initial marking of the process idle places and a special PN structure called strongly connected characteristic resource sunnets (SCCRSs) isrst 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 conguration marking for the resource places in an SCCRS are established. Then, an algorithm for computing a conguration marking in an (SPR)-P-3 is developed, and a resource conguration tree is correspondingly generated according to the execution of the developed algorithm. Thus, the liveness of the congured 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 effcient than other existing ones. Examples are finally provided to illustrate the mentioned results. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/ACCESS.2017.2768069 | IEEE ACCESS |
Keywords | Field | DocType |
Flexible manufacturing system,Petri net,strongly connected characteristic resource subnet | Petri net,Polynomial,Computer science,Manufacturing systems,Deadlock prevention algorithms,Control system,Strongly connected component,Liveness,Distributed computing,Computational complexity theory | Journal |
Volume | ISSN | Citations |
5 | 2169-3536 | 0 |
PageRank | References | Authors |
0.34 | 45 | 5 |