A note on controllability of deterministic context-free systems

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F12%3A00378943" target="_blank" >RIV/67985840:_____/12:00378943 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1016/j.automatica.2012.06.004" target="_blank" >http://dx.doi.org/10.1016/j.automatica.2012.06.004</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.automatica.2012.06.004" target="_blank" >10.1016/j.automatica.2012.06.004</a>

Jazyk výsledku

angličtina

Název v původním jazyce

A note on controllability of deterministic context-free systems

Popis výsledku v původním jazyce

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, ourresult 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...

Název v anglickém jazyce

A note on controllability of deterministic context-free systems

Popis výsledku anglicky

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, ourresult 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...

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

BA - Obecná matematika

OECD FORD obor

—

Projekt

<a href="/cs/project/GPP202%2F11%2FP028" target="_blank" >GPP202/11/P028: Decentralizované a koordinační supervizní řízení</a><br>

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2012

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Automatica

ISSN

0005-1098

e-ISSN

—

Svazek periodika

48

Číslo periodika v rámci svazku

8

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

4

Strana od-do

1934-1937

Kód UT WoS článku

000307688200057

EID výsledku v databázi Scopus

—