Deadlock avoidance in Petri nets with uncontrollable transitions
John O. Moody, Panos J. Antsaklis · 1998
Results in the literature have provided efficient control synthesis techniques for the problem of deadlock avoidance in Petri nets. These results are shown to fit within an established framework for the enforcement of linear constraints on the marking behavior of a net. Framing the problem in this way allows uncontrollable and of unobservable transitions to be included in the plant model when deadlock avoidance is performed.