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

A Software Tool for Live-Lock Avoidance in Systems Modelled Using a Class of Petri NETS

“…The reverse inclusion is shown The observation that we can assume all non-choice transitions are uncontrollable,even when they are not for any ܰ ∈ ℋ, is critical to the speeding-up the execution ofthe software package described in reference [7]. This is illustrated in subsequent text.…”

“…The algorithm in references [5,7], finds a series of outerapproximations Ψ for ∆(ܰ) for an appropriate PNstructure N, that are control invariant with respect to N.…”

“…There is an O(n 2 m 2 ) algorithm that decides if an where ݊ = ܿܽ‫)ߎ(݀ݎ‬and m = card(T) results in reference [5] implies that the existenceof an LESP for the software package described inreference [7] can be used to compute the minimally restrictive LESP for N(m 0 ), whenit exists. As noted in the introduction section, each decidable class of PN structuresidentified in references [4 PN algorithm that decides if an arbitrary PN structure belongs to the class m = card(T).…”

“…The right-closure of ∆(ܰ)for any ܰ ∈ ℋ, along with the results in reference [5] implies that the existenceof an LESP for N(m 0 ) is decidable. the software package described inreference [7] can be used to compute the minimally restrictive , whenit exists. As noted in the introduction section, each decidable class of PN identified in references [4][5][6] to the class ℋ, , along with the is decidable.…”

“…As noted in the introduction section, each decidable class of PN identified in references [4][5][6] to the class ℋ, , along with the is decidable. Furthermore, the software package described inreference [7] can be used to compute the minimally restrictive , whenit exists. As noted in the introduction section, each decidable class of PN .…”