Computing bounds for forbidden state reachability functions for controlled Petri nets

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

doi:10.1109/TSMCA.2003.822279

Computing bounds for forbidden state reachability functions for controlled Petri nets

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

Institute for Sustainable Manufacturing (ISM)

Producción científica: Article › revisión exhaustiva

23 Citas (Scopus)

Resumen

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.

Idioma original	English
Páginas (desde-hasta)	219-228
Número de páginas	10
Publicación	IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans
Volumen	34
N.º	2
DOI	https://doi.org/10.1109/TSMCA.2003.822279
Estado	Published - mar 2004

Nota bibliográfica

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: [email protected]). A. S. Khare is with SpeedTrack, Inc., Solana Beach, CA 92705 USA (e-mail: [email protected]). Y. Gong is with VDC Display Systems, Cape Canaveral, FL 32920 USA (e-mail: [email protected]). Digital Object Identifier 10.1109/TSMCA.2003.822279

Financiación

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: [email protected]). A. S. Khare is with SpeedTrack, Inc., Solana Beach, CA 92705 USA (e-mail: [email protected]). Y. Gong is with VDC Display Systems, Cape Canaveral, FL 32920 USA (e-mail: [email protected]). Digital Object Identifier 10.1109/TSMCA.2003.822279

Financiadores	Número del financiador
University of Kentucky Center for Manufacturing
U.S. Department of Energy Chinese Academy of Sciences Guangzhou Municipal Science and Technology Project Oak Ridge National Laboratory Extreme Science and Engineering Discovery Environment National Science Foundation National Energy Research Scientific Computing Center National Natural Science Foundation of China	ECS-0115694
U.S. Department of Energy Chinese Academy of Sciences Guangzhou Municipal Science and Technology Project Oak Ridge National Laboratory Extreme Science and Engineering Discovery Environment National Science Foundation National Energy Research Scientific Computing Center National Natural Science Foundation of China

ASJC Scopus subject areas

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

Acceder al documento

10.1109/TSMCA.2003.822279

Otros archivos y enlaces

Citar esto

@article{24f76b52476f43d2979810eb59520c88,

title = "Computing bounds for forbidden state reachability functions for controlled Petri nets",

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.",

keywords = "Forbidden state avoidance, Petri nets, Syntax trees",

author = "Holloway, \{Lawrence E.\} and Khare, \{Ajit S.\} and Yu Gong",

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: [email protected]). A. S. Khare is with SpeedTrack, Inc., Solana Beach, CA 92705 USA (e-mail: [email protected]). Y. Gong is with VDC Display Systems, Cape Canaveral, FL 32920 USA (e-mail: [email protected]). Digital Object Identifier 10.1109/TSMCA.2003.822279",

year = "2004",

month = mar,

doi = "10.1109/TSMCA.2003.822279",

language = "English",

volume = "34",

pages = "219--228",

number = "2",

}

TY - JOUR

T1 - Computing bounds for forbidden state reachability functions for controlled Petri nets

AU - Holloway, Lawrence E.

AU - Khare, Ajit S.

AU - Gong, Yu

N1 - 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: [email protected]). A. S. Khare is with SpeedTrack, Inc., Solana Beach, CA 92705 USA (e-mail: [email protected]). Y. Gong is with VDC Display Systems, Cape Canaveral, FL 32920 USA (e-mail: [email protected]). Digital Object Identifier 10.1109/TSMCA.2003.822279

PY - 2004/3

Y1 - 2004/3

N2 - 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.

AB - 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.

KW - Forbidden state avoidance

KW - Petri nets

KW - Syntax trees

UR - https://www.scopus.com/pages/publications/1542605232

UR - https://www.scopus.com/inward/citedby.url?scp=1542605232&partnerID=8YFLogxK

U2 - 10.1109/TSMCA.2003.822279

DO - 10.1109/TSMCA.2003.822279

M3 - Article

AN - SCOPUS:1542605232

SN - 1083-4427

VL - 34

SP - 219

EP - 228

JO - IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans

JF - IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans

IS - 2

ER -

Computing bounds for forbidden state reachability functions for controlled Petri nets

Resumen

Nota bibliográfica

Financiación

ASJC Scopus subject areas

Acceder al documento

Otros archivos y enlaces

Huella

Citar esto