Generating conditions for preserving the properties of controlled discrete event systems

We show how to apply the method of logic‐algebraic equations as a representative of reduction methods that preserve system properties after a transformation. We study the problem of preserving properties of a supervisor for a controllable discrete event system represented as a finite state machine: completeness, non‐rejecting property, and others. We relax previously known requirements imposed on mappings between supervisors.