Number of the records: 1  

On conditional decomposability

  1. 1.
    SYSNO ASEP0383610
    Document TypeJ - Journal Article
    R&D Document TypeJournal Article
    Subsidiary JČlánek ve WOS
    TitleOn conditional decomposability
    Author(s) Komenda, Jan (MU-W) RID, SAI, ORCID
    Masopust, Tomáš (MU-W) RID, ORCID, SAI
    van Schuppen, J. H. (NL)
    Source TitleSystems and Control Letters. - : Elsevier - ISSN 0167-6911
    Roč. 61, č. 12 (2012), s. 1260-1268
    Number of pages9 s.
    Languageeng - English
    CountryNL - Netherlands
    Keywordsdiscrete-event system ; coordination control ; conditional decomposability
    Subject RIVBA - General Mathematics
    R&D ProjectsGPP202/11/P028 GA ČR - Czech Science Foundation (CSF)
    GAP103/11/0517 GA ČR - Czech Science Foundation (CSF)
    Institutional supportMU-W - RVO:67985840
    UT WOS000312510000021
    EID SCOPUS84868703208
    AnnotationThe 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 verification whether 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.
    WorkplaceMathematical Institute
    ContactJarmila Štruncová,,, Tel.: 222 090 757
    Year of Publishing2013
Number of the records: 1