The paper considers how methods of a logical inference search in the calculus of positively constructed formulas may be applied to represent and study discrete event systems. The formalisms of discrete event systems and positively constructed formulas are briefly described. A method for constructing a product of automata using constructive inference in the positively constructed formulas calculus is proposed. Based on the given specication on the behaviour of the system, a method for constructing a supremal controllable sublanguage of the specication is presented.

No abstract

No abstract

The paper provides a general view on the original logical inference based approach to dealing with discrete event systems as subject to supervisory control theory. The approach suggests a representation of discrete event system as a positively constructed formula to imply automated logical inference in the calculus of positively constructed formulas. During the inference, languages of the discrete event system are generated and analyzed. The minimally restricting supervisor for uncontrollable specification may be also designed. A nonblocking supervisor design is illustrated with a simplified model of autonomous underwater vehicle operational modes switching.