In this paper, we investigate the nonblocking supervisor synthesis problem for centralized partially observed discrete event systems. The goal is to synthesize a maximally permissive nonblocking supervisor that not only satisfies a class of properties, e.g., safety, but also contains a given lower bound behavior described by a regular language. We show that this synthesis problem can be effectively reduced to a synthesis problem that has been solved in the literature. A new notion, called R-compatibility, is proposed for the purpose of reduction. Our result generalizes existing algorithms for supervisory synthesis of partially observed discrete event systems. This also leads to solutions of several synthesis problems that were open previously, e.g., the nonblocking range control problem.