Computing bounds for forbidden state reachability functions for controlled Petri nets

L. E. Holloway, A. S. Khare

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 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 to 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
Title of host publicationProceedings - 6th International Workshop on Discrete Event Systems, WODES 2002
EditorsAlessandro Giua, Manuel Silva, Jose M. Colom
Pages225-230
Number of pages6
ISBN (Electronic)0769516831, 9780769516837
DOIs
StatePublished - 2002
Event6th International Workshop on Discrete Event Systems, WODES 2002 - Zaragoza, Spain
Duration: Oct 2 2002Oct 4 2002

Publication series

NameProceedings - 6th International Workshop on Discrete Event Systems, WODES 2002

Conference

Conference6th International Workshop on Discrete Event Systems, WODES 2002
Country/TerritorySpain
CityZaragoza
Period10/2/0210/4/02

Bibliographical note

Publisher Copyright:
© 2002 IEEE.

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Networks and Communications
  • Modeling and Simulation

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