Loading…
Process nets with resources for manufacturing modeling and their analysis
This paper presents a new class of Petri nets, called process nets with resources (PNRs), for modeling manufacturing systems where only parts can interact with resources, and resources alone cannot interact with one another. PNRs properly include S/sup 3/PR, augmented marked graphs, and some subclas...
Saved in:
Published in: | IEEE transactions on robotics and automation 2002-12, Vol.18 (6), p.875-889 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | This paper presents a new class of Petri nets, called process nets with resources (PNRs), for modeling manufacturing systems where only parts can interact with resources, and resources alone cannot interact with one another. PNRs properly include S/sup 3/PR, augmented marked graphs, and some subclasses of resource control net (RCN) merged nets and ERCN merged nets. As a result, PNRs can model far more complex manufacturing process flows and resource sharing than these nets. To construct a PNR, we first build a process net to specify the process flow for each part type. A process net is a consistent, conservative, strongly connected, and live Petri net that satisfies three conditions, including strong reversibility. Then resource places denoting the availability of resource types are added to the process nets. We generalize strong reversibility for PNRs in order to check a sufficient condition for reversibility of PNRs. It is shown that strong reversibility and reversibility of a PNR depends on the siphons. Liveness of a PNR can be verified by checking the potential firing ability of all transitions of each isolated process net, which is, informally speaking, a process net with all resources allocated to it. A manufacturing example is given to show the applicability of PNRs. |
---|---|
ISSN: | 1042-296X 2374-958X |
DOI: | 10.1109/TRA.2002.805655 |