This post is an excerpt from the journal ISA Transactions. All ISA Transactions articles are free to ISA members, or can be purchased from Elsevier Press.
Abstract:
This paper deals with the problem of forbidden states in discrete event systems based on Petri net models. So, a 
method is presented to prevent the system from entering these states by constructing a small number of generalized mutual exclusion constraints. This goal is achieved by solving three types of Integer Linear Programming problems. The problems are designed to verify the constraints that some of them are related to verifying authorized states and the others are related to avoiding forbidden states. The obtained constraints can be enforced on the system using a small number of control places.
Moreover, the number of arcs related to these places is small, and the controller after connecting them is maximally permissive.
Free Bonus! To read the full version of this ISA Transactions article, click here.
ISA membership entitles you to free access to all ISA Transactions articles plus a wealth of technical content, industry information, free webinars, training opportunities, program discounts, certification and licensure and professional networking.
Click here to join ISA ... learn, advance, succeed!
2006 Elsevier Science Ltd. All rights reserved.
