Computing bounds for forbidden State reachability functions for controlled Petri nets

Authors:
L. E. Holloway;A. S. Khare;Yu Gong
Affiliations:
Center for Manuf., Univ. of Kentucky, Lexington, KY, USA;-;-
Venue:
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Year:
2004

Citing 0
Cited 2

Supervisor synthesis for enforcing a class of generalized mutual exclusion constraints on petri nets

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Model-based development of virtual laboratories for robotics over the internet

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans - Special issue on recent advances in biometrics

Quantified Score

Hi-index	0.00

Visualization

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.