A software tool for the automatic synthesis of minimally restrictive liveness enforcing supervisory policies for a class of general Petri net models of manufacturing- and service-systems

We consider liveness enforcing supervisory policies (LESPs) for a class of Petri net (PN) structures that model automated manufacturing systems that are prone to livelocks. This class is identified by the property that the existence of an LESP for an instance initialized with a marking implies the existence of an LESP when the same instance is initialized with a larger marking. If a minimally restrictive LESP prevents the occurrence of a transition at some marking for an instance, then every LESP for the instance should prevent the occurrence of the transition for the same marking. There is a unique minimally restrictive LESP for a PN that has an LESP. After reviewing the relevant theory, this paper describes the implementation details of a procedure for the automatic synthesis of the minimally restrictive LESP for any instance from the aforementioned class.