2000 character limit reached
Maximally Permissive Coordination Supervisory Control -- Towards Necessary and Sufficient Conditions
Published 19 Mar 2014 in math.OC, cs.FL, and cs.SY | (1403.4762v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.