Petri nets for modeling automated manufacturing systems with error recovery

This paper enhances a Petri net synthesis theory with the capability to deal with reversibility, which is an important property related to the concept of error recovery in manufacturing. The theory has been proposed to synthesize a class of Petri nets for modeling shared-resource automated manufacturing systems. The class of nets has been shown to be conservative (bounded) and possess structural liveness under two sufficient conditions. The conditions can be checked structurally by an algorithm without enumerating the states. A bounded and live net means that the modeled system cannot have capacity overflows and deadlocks, two types of unwanted behaviors in manufacturing. In this paper it is further proven that under these two sufficient conditions, the class of nets possesses reversibility. Thus the liveness-checking algorithm can be used to check reversibility without modification.