A Uniform Approach to Maximal Permissiveness in Modular Control of Discrete-Event Systems

TL;DR

This paper introduces a unified framework for achieving maximal permissiveness in modular control of discrete-event systems, utilizing concepts like monotonicity, distributivity, and exchangeability to enhance control design.

Contribution

It presents a novel, uniform approach based on three key concepts, providing new sufficient conditions for distributed computation of supremal relatively observable sublanguages.

Findings

Monotonicity holds when properties are preserved under language unions.

Distributivity is achieved when inverse projections satisfy properties relative to each other.

New conditions enable distributed computation of supremal relatively observable sublanguages.

Abstract

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.