In this paper, a uniform approach to maximal permissiveness in modular control of discrete-event systems is proposed. It is based on three important concepts of modular closed-loops: monotonicity, distributivity, and exchangeability. Monotonicity of various closed-loops satisfying a given property considered in this paper holds whenever the underlying property is preserved under language unions. Distributivity holds if the inverse projections of local plants satisfy the given property with respect to each other. Among new results, sufficient conditions are proposed for distributed computation of supremal relatively observable sublanguages.
تحميل البحث