Deadlock freeness supervisor for Marked Graph

This note presents a control synthesis approach for discrete event systems modeled by marked graphs with uncontrollable transitions. It solves forbidden state problems characterized by a set of general mutual exclusion constraints. We prove that the closed loop control can reach a deadlock situation. Using the structural proprieties of marked graph we defined causes of the deadlock situation, and we defined a formal method to avoid it.