Distributed computation of supremal conditionally-controllable sublanguages

Jan KomendaJan Komenda, Tomáš MasopustTomáš Masopust

ISSN: 0020-7179
DOI Link

Jan Komenda, Tomáš Masopust
Distributed computation of supremal conditionally-controllable sublanguages
International Journal of Control, 89(2):424-436, 2016

Details
Bibtex

KurzfassungAbstract
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.
Forschungsgruppe:Research Group: Wissensbasierte SystemeKnowledge-Based Systems

@article{KM2016,
  author  = {Jan Komenda and Tom{\'{a}}{\v{s}} Masopust},
  title   = {Distributed computation of supremal conditionally-controllable
             sublanguages},
  journal = {International Journal of Control},
  volume  = {89},
  number  = {2},
  year    = {2016},
  pages   = {424-436},
  doi     = {10.1080/00207179.2015.1079736}
}