Extracting all minimal siphons from maximal unmarked siphons in manufacturing-oriented Petri nets

Document Type

Conference Proceeding

Publication Date

12-5-2011

Abstract

Deadlock control is an important research issue in automated manufacturing systems that have a high degree of resource sharing and concurrency. Since minimal siphons are closely tied with deadlocks in Petri net models, their efficient extraction is fundamentally important. The existing methods can rapidly extract one minimal siphon given a maximal unmarked siphon that is obtained by using a mixed integer programming approach. This paper for the first time presents an extraction algorithm that can efficiently extract all minimal ones. The idea is based on the generation and use of a subnet tree structure given the places in a maximal unmarked siphon. Several Petri net models of automated manufacturing systems are used to illustrate the proposed concepts and methods. © 2011 IEEE.

Identifier

82455175426 (Scopus)

ISBN

[9781457717307]

Publication Title

IEEE International Conference on Automation Science and Engineering

External Full Text Location

https://doi.org/10.1109/CASE.2011.6042447

e-ISSN

21618089

ISSN

21618070

First Page

399

Last Page

404

This document is currently not available here.

Share

COinS