Fault detection and initial state verification by linear programming for a class of Petri netsThe authors present an algorithmic approach to determining when the marking of a LSMG (live safe marked graph) or a LSFC (live safe free choice) net is in the set of live safe markings M. Hence, once the marking of a net is determined to be in M, then if at some time thereafter the marking of this net is determined not to be in M, this indicates a fault. It is shown how linear programming can be used to determine if m is an element of M. The worst-case computational complexity of each algorithm is bounded by the number of linear programs necessary to compute.
Document ID
19930038977
Acquisition Source
Legacy CDMS
Document Type
Conference Paper
Authors
Rachell, Traxon (NASA Headquarters Washington, DC United States)
Meyer, David G. (Virginia Univ. Charlottesville, United States)
Date Acquired
August 16, 2013
Publication Date
January 1, 1992
Publication Information
Publication: In: 1992 American Control Conference, 11th, Chicago, IL, June 24-26, 1992, Proceedings. Vol. 4 (A93-22776 07-63)
Publisher: Institute of Electrical and Electronics Engineers