Extending Supervisory Controller Synthesis to Deterministic Pushdown Automata— Enforcing Controllability Least Restrictively

In this paper a step towards the generalization of supervisory control theory to situations where the specification is modeled by a deterministic pushdown automaton (DPDA) is provided. In particular, this paper presents an algorithm to calculate the largest controllable marked sublanguage of a given deterministic context free language (DCFL) by least restrictively removing controllability problems in a DPDA realization of this DCFL. It also provides a counterexample which shows that the algorithm by Griffin (2008) intended to solve the considered problem is not minimally restrictive.