Translation of output constraint into event constraint in the control of discrete event systems

The output-constrained language of an automation and a translator that translates output constraint into event constraint are formally defined. An algorithm for the construction of a translator is introduced. This allows output constraint to be used to formulate requirements for a discrete-event system. This formulation is in many cases much easier than using event constraint directly. The algorithm is an O(m×n×k) algorithm, where m is the number of states in the constraint, and k is the number of events. By eliminating the inaccessible states in the translator, a more efficient algorithm can be derived