Synthesis of controllable and normal sublanguages for discrete-event systems using a coordinator

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche

Toggle side column

Synthesis of controllable and normal sublanguages for discrete-event systems using a coordinator

Jan KomendaJan Komenda,  Tomáš MasopustTomáš Masopust,  Jan H. van SchuppenJan H. van Schuppen
Synthesis of controllable and normal sublanguages for discrete-event systems using a coordinator


Jan Komenda, Tomáš Masopust, Jan H. van Schuppen
Synthesis of controllable and normal sublanguages for discrete-event systems using a coordinator
Systems & Control Letters, 60(7):492-502, 2011
  • KurzfassungAbstract
    Synthesis of normal or controllable and normal sublanguages of global specification languages without computation of the global modular plant is a difficult problem. In this paper, these sublanguages are computed using a coordinator. We recall the notion of conditional controllability, introduce a notion of conditional normality, and prove necessary and sufficient conditions where such a computation is possible. Specifically, we show that conditionally controllable and conditionally normal languages computed by our method are controllable and normal with respect to the global plant. The optimality (supremality) of the resulting languages is also discussed.
  • Forschungsgruppe:Research Group: Wissensbasierte SystemeKnowledge-Based Systems
@article{KMS2011,
  author  = {Jan Komenda and Tom{\'{a}}{\v{s}} Masopust and Jan H. van Schuppen},
  title   = {Synthesis of controllable and normal sublanguages for
             discrete-event systems using a coordinator},
  journal = {Systems \& Control Letters},
  volume  = {60},
  number  = {7},
  year    = {2011},
  pages   = {492-502}
}