On conditional decomposability

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

Result language
angličtina
Original language name
On conditional decomposability
Original language description
The requirement of a language to be conditionally decomposable is imposed on a specification language in the coordination supervisory control framework of discrete-event systems. In this paper, we present a polynomial-time algorithm for the verificationwhether a language is conditionally decomposable with respect to given alphabets. Moreover, we also present a polynomial-time algorithm to extend the common alphabet so that the language becomes conditionally decomposable. A relationship of conditional decomposability to nonblockingness of modular discrete-event systems is also discussed in this paper in the general settings. It is shown that conditional decomposability is a weaker condition than nonblockingness.
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
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)