Coordination control of discrete-event systems revisited

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F15%3A00443131" target="_blank" >RIV/67985840:_____/15:00443131 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1007/s10626-013-0179-x" target="_blank" >http://dx.doi.org/10.1007/s10626-013-0179-x</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/s10626-013-0179-x" target="_blank" >10.1007/s10626-013-0179-x</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Coordination control of discrete-event systems revisited

Popis výsledku v původním jazyce

In this paper, we revise and further investigate the coordination control approach proposed for supervisory control of distributed discrete-event systems with synchronous communication based on the Ramadge-Wonham automata framework. The notions of conditional decomposability, conditional controllability, and conditional closedness ensuring the existence of a solution are carefully revised and simplified. The approach is generalized to non-prefix-closed languages, that is, supremal conditionally controllable sublanguages of not necessary prefix-closed languages are discussed. Non-prefix-closed languages introduce the blocking issue into coordination control, hence a procedure to compute a coordinator for nonblockingness is included. The optimization problem concerning the size of a coordinator is under investigation. We prove that to find the minimal extension of the coordinator event set for which a given specification language is conditionally decomposable is NP-hard.

Název v anglickém jazyce

Coordination control of discrete-event systems revisited

Popis výsledku anglicky

In this paper, we revise and further investigate the coordination control approach proposed for supervisory control of distributed discrete-event systems with synchronous communication based on the Ramadge-Wonham automata framework. The notions of conditional decomposability, conditional controllability, and conditional closedness ensuring the existence of a solution are carefully revised and simplified. The approach is generalized to non-prefix-closed languages, that is, supremal conditionally controllable sublanguages of not necessary prefix-closed languages are discussed. Non-prefix-closed languages introduce the blocking issue into coordination control, hence a procedure to compute a coordinator for nonblockingness is included. The optimization problem concerning the size of a coordinator is under investigation. We prove that to find the minimal extension of the coordinator event set for which a given specification language is conditionally decomposable is NP-hard.

Druh

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

CEP obor

BA - Obecná matematika

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2015

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

Discrete Event Dynamic Systems-Theory and Applications

ISSN

0924-6703

e-ISSN

—

Svazek periodika

25

Číslo periodika v rámci svazku

1-2

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

30

Strana od-do

65-94

Kód UT WoS článku

000352212000005

EID výsledku v databázi Scopus

2-s2.0-84926278189