Complexity of verifying nonblockingness in modular supervisory control
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F18%3A00486267" target="_blank" >RIV/67985840:_____/18:00486267 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1109/TAC.2017.2726582" target="_blank" >http://dx.doi.org/10.1109/TAC.2017.2726582</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/TAC.2017.2726582" target="_blank" >10.1109/TAC.2017.2726582</a>
Alternative languages
Result language
angličtina
Original language name
Complexity of verifying nonblockingness in modular supervisory control
Original language description
Complexity analysis becomes a common task in supervisory control. However, many results of interest are spread across different topics. The aim of this paper is to bring several interesting results from complexity theory and to illustrate their relevance to supervisory control by proving new nontrivial results concerning nonblockingness in modular supervisory control of discrete event systems modeled by finite automata.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
20205 - Automation and control systems
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2018
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
IEEE Transactions on Automatic Control
ISSN
0018-9286
e-ISSN
—
Volume of the periodical
63
Issue of the periodical within the volume
2
Country of publishing house
US - UNITED STATES
Number of pages
6
Pages from-to
602-607
UT code for WoS article
000423553000028
EID of the result in the Scopus database
2-s2.0-85028928831