Modular control of discrete-event systems using similarity

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F22%3A00558102" target="_blank" >RIV/67985840:_____/22:00558102 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/61989592:15310/22:73614730

Výsledek na webu

<a href="https://doi.org/10.1016/j.automatica.2022.110431" target="_blank" >https://doi.org/10.1016/j.automatica.2022.110431</a>

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

Modular control of discrete-event systems using similarity

Popis výsledku v původním jazyce

We investigate modular supervisory control of discrete-event systems composed of several groups of components, where each group consists of similar modules. Because of the similar structures of the modules, such systems can be represented as a set of (group) templates. Supervisory control can then be performed on these templates, resulting in a set of template supervisors. We propose a modular approach to construct the template supervisors based on the local computation of supremal symmetric sublanguages and on the concept of conditional decomposability. The supremal symmetric sublanguage of a decomposable language turns out to be decomposable, and can thus be computed locally. It is proven that the local supervisors of the components of a group are similar and can thus be obtained by a symmetry map from the template supervisor of the group.

Název v anglickém jazyce

Modular control of discrete-event systems using similarity

Popis výsledku anglicky

We investigate modular supervisory control of discrete-event systems composed of several groups of components, where each group consists of similar modules. Because of the similar structures of the modules, such systems can be represented as a set of (group) templates. Supervisory control can then be performed on these templates, resulting in a set of template supervisors. We propose a modular approach to construct the template supervisors based on the local computation of supremal symmetric sublanguages and on the concept of conditional decomposability. The supremal symmetric sublanguage of a decomposable language turns out to be decomposable, and can thus be computed locally. It is proven that the local supervisors of the components of a group are similar and can thus be obtained by a symmetry map from the template supervisor of the group.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

20205 - Automation and control systems

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í

2022

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

1873-2836

Svazek periodika

142

Číslo periodika v rámci svazku

August

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

8

Strana od-do

110431

Kód UT WoS článku

000833420300002

EID výsledku v databázi Scopus

2-s2.0-85131669646