Supervisory control synthesis for deterministic context free specification languages

This paper describes two steps in the generalization of supervisory control theory to situations where the specification is modeled by a deterministic context free language (DCFL). First, it summarizes a conceptual iterative algorithm from Schneider et al. (2014) solving the supervisory control problem for language models. This algorithm involves two basic iterative functions. Second, the main part of this paper presents an implementable algorithm realizing one of these functions, namely the calculation of the largest controllable marked sublanguage of a given DCFL. This algorithm least restrictively removes controllability problems in a deterministic pushdown automaton realizing this DCFL.