Algebraic synthesis of timed supervisor for automated manufacturing systems using petri nets

Document Type

Article

Publication Date

7-1-2010

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. © 2010 IEEE.

Identifier

77954383996 (Scopus)

Publication Title

IEEE Transactions on Automation Science and Engineering

External Full Text Location

https://doi.org/10.1109/TASE.2009.2037825

ISSN

15455955

First Page

549

Last Page

557

Issue

3

Volume

7

Grant

60474018

Fund Ref

National Natural Science Foundation of China

This document is currently not available here.

Share

COinS