Synthesis of controllable and normal sublanguages for discrete-event systems using a coordinator

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F11%3A00360187" target="_blank" >RIV/67985840:_____/11:00360187 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.sysconle.2011.04.005" target="_blank" >http://dx.doi.org/10.1016/j.sysconle.2011.04.005</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.sysconle.2011.04.005" target="_blank" >10.1016/j.sysconle.2011.04.005</a>

Result language
angličtina
Original language name
Synthesis of controllable and normal sublanguages for discrete-event systems using a coordinator
Original language description
Synthesis of normal or controllable and normal sublanguages of global specification languages without computation of the global modular plant is a difficult problem. In this paper, these sublanguages are computed using a coordinator. We recall the notionof conditional controllability, introduce a notion of conditional normality, and prove necessary and sufficient conditions where such a computation is possible. Specifically, we show that conditionally controllable and conditionally normal languages computed by our method are controllable and normal with respect to the global plant. The optimality (supremality) of the resulting languages is also discussed.
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
Z - Vyzkumny zamer (s odkazem do CEZ)

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

Similar results(10)