In this article, we consider a supervisory control problem for nondeterministic discrete‐event systems. In the conventional supervisory control problem for the deterministic plant with the deterministic specification, equivalence of the generated or marked language of the supervised plant and the specification language is required. When both the plant and the specification are nondeterministic, a notion of equivalence stronger than language equivalence is required. Bisimulation equivalence is stronger than language equivalence and it has been widely used for verification and control of dynamical systems. A bisimilarity control problem requires us to synthesize a possibly nondeterministic supervisor such that the supervised plant and the specification are bisimilar. We present a necessary and sufficient condition for the existence of a supervisor that solves the bisimilarity control problem and how to synthesize such a supervisor if it exists. Furthermore, we show that a nondeterministic supervisor is more powerful than a deterministic one for the bisimilarity control problem.