Distributed computation of supremal conditionally-controllable sublanguages

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F16%3A00453022" target="_blank" >RIV/67985840:_____/16:00453022 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1080/00207179.2015.1079736" target="_blank" >http://dx.doi.org/10.1080/00207179.2015.1079736</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1080/00207179.2015.1079736" target="_blank" >10.1080/00207179.2015.1079736</a>

Result language
angličtina
Original language name
Distributed computation of supremal conditionally-controllable sublanguages
Original language description
In this paper, we further develop the coordination control framework for discrete-event systems with both complete and partial observations. First, a weaker sufficient condition for the computation of the supremal conditionally controllable sublanguage and conditionally normal sublanguage is presented. Then we show that this condition can be imposed by synthesising a-posteriori supervisors. The paper further generalises the previous study by considering general, non-prefix-closed languages. Moreover, weprove that for prefix-closed languages the supremal conditionally controllable sublanguage and conditionally normal sublanguage can always be computed in the distributed way without any restrictive conditions we have used in the past.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

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

Similar results(10)