In: IEEE Trans. on Automatic Control, Vol. 40, No. 5, pages 906-910. 1995.
Abstract: We extend the class of control problems that can be modeled by Petri nets considering the notion of weak terminal behavior. Deterministic weak languages represent closed-loop terminal behaviors that may be enforced by nonblocking Petri net supervisors if controllable. The class of deterministic weak PN languages is not closed under the supremal controllable sublanguage operator.
Keywords: Petri net languages, closure properties, decidability problems.