Layered optimal supervisory control of discrete event dynamical systems
K.-H. Cho
Abstract
K.-H. Cho
Abstract
In this paper, a complete min-cut of the flow network induced from the finite state machine of a discrete event dynamical system is introduced so that the solution of the optimal supervisory control problem, which is transformed into an optimal state space partitioning problem, also includes the marked languages. Moreover, the procedure for finding the achievable or non-achievable layered optimal legal sublanguages is suggested for a preferential option among the reachable states in the controlled plant. Finally, an analytical framework for a layered optimal supervisory control system is presented.
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper, a complete min-cut of the flow network induced from the finite state machine of a discrete event dynamical system is introduced so that the solution of the optimal supervisory control problem, which is transformed into an optimal state space partitioning problem, also includes the marked languages. Moreover, the procedure for finding the achievable or non-achievable layered optimal legal sublanguages is suggested for a preferential option among the reachable states in the controlled plant. Finally, an analytical framework for a layered optimal supervisory control system is presented.
Key concepts: Supervisory control, Optimal control, State (computer science), State space, Discrete event dynamic system, Control theory (sociology), Event (particle physics), Control (management)