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

Hesuan Hu, Mengchu Zhou, Zhiwu Li

Research output: Contribution to journalArticlepeer-review

61 Scopus citations


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 languageEnglish (US)
Article number5393024
Pages (from-to)549-557
Number of pages9
JournalIEEE Transactions on Automation Science and Engineering
Issue number3
StatePublished - Jul 2010

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Electrical and Electronic Engineering


  • Automated manufacturing systems
  • Petri nets
  • supervisory control
  • theory of regions
  • timed Petri nets


Dive into the research topics of 'Algebraic synthesis of timed supervisor for automated manufacturing systems using petri nets'. Together they form a unique fingerprint.

Cite this