A generalization of state avoidance policies for controlled Petri nets

Lawrence E. Holloway, Xiaoyi Guan, Lan Zhang

Research output: Contribution to journalArticlepeer-review

78 Scopus citations


This paper presents a generalization of forbidden state control synthesis methods for a broad class of controlled Petri nets (CtlPN). An algebra is defined for characterizing the interaction of paths in the Petri net. Given a specification of a forbidden marking set, the net structure is analyzed to determine an algebraic expression to represent the specification. For any net marking (state), evaluation of the expression will indicate whether forbidden markings are reachable and whether control is necessary. The expression is then used for determining the maximally permissive feedback control law.

Original languageEnglish
Pages (from-to)804-816
Number of pages13
JournalIEEE Transactions on Automatic Control
Issue number6
StatePublished - 1996

Bibliographical note

Funding Information:
Manuscript received January 6, 1995; revised December 22, 1995. Recommended by Associate Editor, W.-B. Gong. This work was supported in part by the NSF under Grant ECS-9308737, Rockwell International, NASA under Grant NGT-40049, and the Center for Robotics and Manufacturing Systems at the University of Kentucky.

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Science Applications
  • Electrical and Electronic Engineering


Dive into the research topics of 'A generalization of state avoidance policies for controlled Petri nets'. Together they form a unique fingerprint.

Cite this