# A note on controllability of deterministic context-free systems

From International Center for Computational Logic

# A note on controllability of deterministic context-free systems

##### Tomáš MasopustTomáš Masopust

Tomáš Masopust

Automatica, 48(8):1934-1937, 2012

**A note on controllability of deterministic context-free systems**Automatica, 48(8):1934-1937, 2012

**Kurzfassung****Abstract**

In this paper, we prove that the most important concept of supervisory control of discrete-event systems, the controllability property, is undecidable for two deterministic context-free languages K and L, where L is prefix closed, even though K is a subset of L. If K is not a subset of L, the undecidability follows from the work by Sreenivas. However, the case where K is a subset of L does not follow from that work because it is decidable whether K and L are equivalent as shown by Sénizergues. Thus, our result completes this study. The problem is also mentioned as open in the Ph.D. thesis by Griffin, who extended the supervisory control framework so that the specification language is modeled as a deterministic context-free language (compared to the classical approach where the specification is regular) and the plant language is regular. This approach is of interest because it brings an opportunity for more concise representations of the specification (as discussed, e.g., in the work by Geffert et al.) and, therefore, in some sense it treats the most interesting problem of current supervisory control theory, the state-space explosion problem.**Forschungsgruppe:****Research Group:**Wissensbasierte Systeme

@article{M2012, author = {Tom{\'{a}}{\v{s}} Masopust}, title = {A note on controllability of deterministic context-free systems}, journal = {Automatica}, volume = {48}, number = {8}, year = {2012}, pages = {1934-1937}, doi = {10.1016/j.automatica.2012.06.004} }