1993•Control theory & applicationsRequires access

A New Method of Supervisor Synthesis for Discrete Event Systems

Zhiping Jiang

Open publisher page 0 citations

Abstract

A Mealy-type automaton corrasponding to a controlled discrete event system is obtained by specifying for each discrete event in the system a control value satisfying certain constraints. Then, we will get a state-value-assigned supervisor using a standard automata transformation from a Mealy machine to its Moore equivalent. After deleting all the inaccessible states of the resultant Moore machine, we will eventually achieve a suprem supervisor for the original discrete event system without any extra state.

About this research paper

What this paper is about

A Mealy-type automaton corrasponding to a controlled discrete event system is obtained by specifying for each discrete event in the system a control value satisfying certain constraints. Then, we will get a state-value-assigned supervisor using a standard automata transformation from a Mealy machine to its Moore equivalent. After deleting all the inaccessible states of the resultant Moore machine, we will eventually achieve a suprem supervisor for the original discrete event system without any extra state.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

A Mealy-type automaton corrasponding to a controlled discrete event system is obtained by specifying for each discrete event in the system a control value satisfying certain constraints. Then, we will get a state-value-assigned supervisor using a standard automata transformation from a Mealy machine to its Moore equivalent. After deleting all the inaccessible states of the resultant Moore machine, we will eventually achieve a suprem supervisor for the original discrete event system without any extra state.

Key concepts: Supervisor, Automaton, Event (particle physics), Transformation (genetics), Supervisory control, Discrete event dynamic system, Timed automaton, Computer science

Related papers

Back to paper searchBrowse research topicsOriginal source
A New Method of Supervisor Synthesis for Discrete Event Systems — Research Paper | ScholarLens