Deadlock resolution method for automated manufacturing systems modeled with Petri nets

For automated manufacturing systems (AMS), deadlock resolution in terms of their Petri net models remains an attractive topic to which many approaches are dedicated. However, few of them can quantitatively optimize certain indices during their supervisor synthesis process. This causes unnecessary control limitations and often leads to unnecessary implementation cost. In the framework of Petri nets, this paper proposes a method to synthesize a cost-effective supervisor with the aid of a set of mixed integer programming (MIP) formulations. Examples are used to validate the legality of the proposed method.