On the well-posedness, equivalency, and low-complexity translation techniques of discrete-time hybrid automaton and piecewise affine systems.

The main contribution of this paper is to present the systematic and low-complexity translation techniques between a class of hybrid systems referred to as automaton-based Discrete-time Hybrid Automata (DHA) and piecewise affine (PWA) systems. As a starting point, the general modeling framework of the automaton-based DHA is represented, which models the controlled and uncontrolled switching phenomena between linear continuous dynamics including discrete and continuous states, inputs and outputs. The basic theoretical definitions on the state trajectories of the proposed DHA with forward and backward evolutions that yield forward and backward piecewise affine (FPWA and BPWA) systems are given. Next, the well-posedness and equivalency properties are proposed and the sufficient conditions under which the wellposedness property is achieved with the automaton-based DHA and PWA systems are given. It is shown that the graphical structure of the proposed automaton-based DHA makes it possible to obtain analytically the equivalent PWA system with polynomial complexity in contrast to the existing numerical translation techniques via decomposed structure of the DHA with exponential complexity. Examples are presented to confirm the effectiveness of the proposed translation techniques. [ABSTRACT FROM AUTHOR]

Copyright of Scientia Iranica. Transaction D, Computer Science & Engineering & Electrical Engineering is the property of Scientia Iranica and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)