By Topic

Comments on "feedback control logic for forbidden-state problems of marked graphs: application to a real manufacturing system"

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
W. M. Wonham ; Dept. of Electr. & Comput. Eng., Univ. of Toronto, Ont., Canada

The AIP manufacturing testbed discussed by Ghaffari et al. (see ibid., vol. 48, p.18-29, 2003) was previously treated using automaton-based [as distinct from Petri net (PN)-based] supervisory control theory (SCT). Problems of this general type have been transcribed from the PN literature, sometimes greatly enlarged, converted into SCT format, and solved using integer-decision-diagram (IDD) techniques with only modest expenditure of time and memory. Thus it is substantially misleading to state, that "the AIP control problem would require huge processing time and memory if addressed with the Ramadge-Wonham [SCT] approach." In contrast to the restriction in Ghaffari et al. (2003) to "marked graphs", no prior structural restrictions other than finiteness of the state set (or boundedness in the case of PNs) were placed on the models of system components.

Published in:

IEEE Transactions on Automatic Control  (Volume:49 ,  Issue: 4 )