Distributed computation of supremal conditionally-controllable sublanguages

0453022 - MÚ 2016 RIV GB eng J - Journal Article
Komenda, Jan - Masopust, Tomáš
Distributed computation of supremal conditionally-controllable sublanguages.
International Journal of Control. Roč. 89, č. 2 (2016), s. 424-436. ISSN 0020-7179. E-ISSN 1366-5820
R&D Projects: GA ČR GA15-02532S; GA MŠMT LH13012
Institutional support: RVO:67985840
Keywords : discrete-event systems * supervisory control * coordination control
Subject RIV: BA - General Mathematics
Impact factor: 2.208, year: 2016
http://www.tandfonline.com/doi/full/10.1080/00207179.2015.1079736

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, we prove 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.
Permanent Link: http://hdl.handle.net/11104/0253899