A Class of Conflict Free Petri Nets Used for Controlling Manufacturing Systems
| dc.contributor.author | Harhalakis, George | en_US |
| dc.contributor.author | Levantopoulos, Marios M. | en_US |
| dc.contributor.author | Lin, Chang-Pin | en_US |
| dc.contributor.author | Nagi, R. | en_US |
| dc.contributor.author | Proth, J.M. | en_US |
| dc.contributor.department | ISR | en_US |
| dc.date.accessioned | 2007-05-23T09:51:27Z | |
| dc.date.available | 2007-05-23T09:51:27Z | |
| dc.date.issued | 1992 | en_US |
| dc.description.abstract | This paper is devoted to the behavior, evaluation and management of non-cyclic discrete systems in general and manufacturing systems in particular. We introduce a special type of Petri nets called CFIOs (Conflict-Free nets with Input and Output transitions). It is shown that CFIOs are live, reversible if consistent, and can be kept bounded under certain conditions. We also develop reduction rules which facilitate the computation of the t-invariants of CFIOs. We then take advantage of the qualitative properties of CFIOs to perform planning in manufacturing systems. Numerical examples illustrate these approaches | en_US |
| dc.format.extent | 1136503 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1903/5271 | |
| dc.language.iso | en_US | en_US |
| dc.relation.ispartofseries | ISR; TR 1992-90 | en_US |
| dc.subject | algorithms | en_US |
| dc.subject | computational complexity | en_US |
| dc.subject | graph theory | en_US |
| dc.subject | computer integrated manufacturing | en_US |
| dc.subject | discrete event dynamical systems | en_US |
| dc.subject | manufacturing | en_US |
| dc.subject | Manufacturing Systems | en_US |
| dc.title | A Class of Conflict Free Petri Nets Used for Controlling Manufacturing Systems | en_US |
| dc.type | Technical Report | en_US |
Files
Original bundle
1 - 1 of 1