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

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.