A new algorithm for translating MLD systems into PWA systems

This work presents a new algorithm for translating mixed logical and dynamical (MLD) systems into piecewise affine (PWA) systems. The presented algorithm uses an enumeration technique and solves several linear programming problems in order to obtain the equivalence. The obtained model is equivalent to the MLD model meaning that given an initial state and an input sequence, the trajectory of the state vector and output vector are the same. The technique is applied to three examples. The computation time and the simulation results for these examples are given.