On the time-reparametrization of quasi-polynomial systems

In this Letter we show that an important type of time-reparametrization problem in quasi-polynomial systems is equivalent to the feasibility of a suitably constructed bilinear matrix inequality where the unknowns are the coefficients of the Lyapunov function and the exponents in the time-reparametrization transformation.