Abstract
For practical automated manufacturing systems (AMSs), the time dimension is of great significance and should be integrated in their plant models. Reasonably, many of the realistic general mutual exclusion constraints (GMECs) imposed on these discrete models should be timed rather than merely algebraic or logic. In the past, such a problem was studied on the basis of the RamadgeWonham supervisory control technique (SCT) and the theory of regions. It proves to be NP-hard since it necessitates the generation of reachability graphs. This paper shows that it can be solvable in polynomial time by using generalized linear constraints, which are originally proposed to increase the expressive power of the linear marking constraints. By dividing each constraint into marking, firing vector, and Parikh terms, its respective control place can be synthesized algebraically without considering the separation of dangerous states and events. Several examples are used to validate the effectiveness and efficiency of the proposed approach.
Original language | English (US) |
---|---|
Article number | 5393024 |
Pages (from-to) | 549-557 |
Number of pages | 9 |
Journal | IEEE Transactions on Automation Science and Engineering |
Volume | 7 |
Issue number | 3 |
DOIs | |
State | Published - Jul 2010 |
All Science Journal Classification (ASJC) codes
- Control and Systems Engineering
- Electrical and Electronic Engineering
Keywords
- Automated manufacturing systems
- Petri nets
- supervisory control
- theory of regions
- timed Petri nets