The paper describes the principles of the implementation of supervisors for discrete event systems, designed with the help of automatic theorem proving in the calculus of positively constructed formulas. The main advantage of the proposed approach is the ability to carry out complex evaluations of events on the base of the current state of the system. Computable predicates are also may be employed, definitions of which are based on the data coming from external sources. As an illustrative example a mobile robot movement in an unknown environment is considered.