Computing bounds for forbidden state reachability functions for controlled Petri nets

Lawrence E. Holloway, Ajit S. Khare, Yu Gong

Research output: Contribution to journalArticlepeer-review

23 Scopus citations

Abstract

Characterizing uncontrollable reachability is a central issue in forbidden state control of discrete event systems. In this paper, we present methods for building expressions which estimate uncontrollable reachability in a general class of Petri nets and which characterize the control sets which ensure future markings will not be forbidden. These expressions are determined by constructing an abstract syntax tree from an analysis of the Petri net model of the system. We show that these expressions represent bounds that are useful for evaluating uncontrollable reachability and for evaluating control actions.

Original languageEnglish
Pages (from-to)219-228
Number of pages10
JournalIEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans
Volume34
Issue number2
DOIs
StatePublished - Mar 2004

Bibliographical note

Funding Information:
Manuscript received March 14, 2003; revised November 21, 2003. This work was supported in part by the National Science Foundation under Grant ECS-0115694 and the University of Kentucky Center for Manufacturing. This paper was recommended by Associate Editor M. Zhou. L. E. Holloway is with the Center for Manufacturing, University of Kentucky, Lexington, KY 40506-0108 USA (e-mail: holloway@engr.uky.edu). A. S. Khare is with SpeedTrack, Inc., Solana Beach, CA 92705 USA (e-mail: ajitskhare@yahoo.com). Y. Gong is with VDC Display Systems, Cape Canaveral, FL 32920 USA (e-mail: ygong1@uky.edu). Digital Object Identifier 10.1109/TSMCA.2003.822279

Keywords

  • Forbidden state avoidance
  • Petri nets
  • Syntax trees

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Software
  • Information Systems
  • Human-Computer Interaction
  • Computer Science Applications
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Computing bounds for forbidden state reachability functions for controlled Petri nets'. Together they form a unique fingerprint.

Cite this