Skip Navigation


The Computer Journal Advance Access originally published online on May 12, 2006
The Computer Journal 2006 49(4):470-479; doi:10.1093/comjnl/bxl019
This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow Colour version of Figure 1
Right arrow All Versions of this Article:
49/4/470    most recent
bxl019v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (4)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Chao, D. Y.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2006. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Computation of Elementary Siphons in Petri Nets For Deadlock Control

Daniel Yuh Chao 1

Department of Management and Information Science, National Cheng Chi University Taipei, Taiwan, ROC

Email: yaw{at}mis.nccu.edu.tw

When designing liveness-enforcing Petri net supervisors, unlike other techniques, Li et al. added control places and arcs to a plant net model for its elementary siphons only, greatly reducing the structural complexity of the controlled system. Their method, however, suffers from the expensive computation of siphons. We propose a new T-characteristic vector {zeta} to compute strict minimal siphons (SMS) for S3PR (systems of simple sequential processes with resources) in an algebraic fashion. For a special subclass of S3PR, called S4PR (simple S3PR), we discover that elementary siphons can be constructed from elementary circuits where all places are resources. Thus, the set of elementary siphons can be computed without the knowledge of all SMS. We also propose to construct characteristic T-vectors {eta} by building a graph to find dependent siphons without their computations.

Key Words: flexible manufacturing systems • deadlock prevention • Petri nets • siphons • S3PR


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.