Maximally Permissive Coordination Supervisory Control -- Towards Necessary and Sufficient Conditions

TL;DR

This paper advances the coordination control framework for discrete-event systems by providing weaker conditions for supremal sublanguage computation, including non-prefix-closed languages, enhancing control design under complete and partial observation.

Contribution

It introduces a weaker sufficient condition for supremal conditionally controllable sublanguage computation and generalizes the framework to non-prefix-closed languages.

Findings

Weaker sufficient condition for supremal conditionally controllable sublanguage.

Extension of the framework to non-prefix-closed languages.

Improved methods for control synthesis in discrete-event systems.

Abstract

In this paper, we further develop the coordination control framework for discrete-event systems with both complete and partial observation. A new weaker sufficient condition for the computation of the supremal conditionally controllable sublanguage is presented. This result is then used for the computation of the supremal conditionally controllable and conditionally normal sublanguage. The paper further generalizes the previous study by considering general, non-prefix-closed languages.