Synthesis of Maximally Permissive Supervisors for Nondeterministic Discrete Event Systems With Nondeterministic Specifications

In this article, we consider the problem of synthesizing a nondeterministic supervisor for the plant and the specification modeled as nondeterministic automata. A similarity control problem requires us to synthesize a supervisor such that the supervised plant is simulated by the specification. Ideally, the synthesized supervisor should be as permissive as possible. We develop a method for synthesizing a maximally permissive supervisor that solves the similarity control problem.

Automated summary

In the article, the problem of synthesizing a nondeterministic supervisor for the plant and the specification modeled as nondeterministic automata is considered. The goal is to develop a maximally permissive supervisor for the similarity control problem.