Bisimilarity enforcing supervisory control of nondeterministic discrete event systems with nondeterministic specifications

Abstract

We consider a bisimilarity control problem for the plant and the specification modeled as nondeterministic automata. This problem requires us to synthesize a nondeterministic supervisor such that the supervised plant is bisimilar to the specification. We derive a new necessary and sufficient condition for the existence of a supervisor that solves the bisimilarity control problem. Although the complexity of verifying this existence condition is exponential in the numbers of states of the plant and the specification, it is smaller than that of the exhaustive search that uses the existing condition. We present how to synthesize a solution to the bisimilarity control problem if it exists. In addition, we give a polynomially verifiable necessary condition.