Number of the records: 1  

On conditional decomposability

  1. 1.
    0383610 - MÚ 2013 RIV NL eng J - Journal Article
    Komenda, Jan - Masopust, Tomáš - van Schuppen, J. H.
    On conditional decomposability.
    Systems and Control Letters. Roč. 61, č. 12 (2012), s. 1260-1268. ISSN 0167-6911. E-ISSN 1872-7956
    R&D Projects: GA ČR(CZ) GPP202/11/P028; GA ČR(CZ) GAP103/11/0517
    Institutional support: RVO:67985840
    Keywords : discrete-event system * coordination control * conditional decomposability
    Subject RIV: BA - General Mathematics
    Impact factor: 1.667, year: 2012
    http://www.sciencedirect.com/science/article/pii/S0167691112001612

    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 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.
    Permanent Link: http://hdl.handle.net/11104/0213494

     
    FileDownloadSizeCommentaryVersionAccess
    Komenda.pdf11290.2 KBPublisher’s postprintrequire
     
Number of the records: 1