Deciding the boundedness and dead-beat stability of constrained switching systems

Second, we provide a polynomial time algorithm for deciding the dead-beat stability of a system, i.e. that all trajectories vanish to the origin in finite time. The algorithm generalizes one proposed by Gurvits for arbitrary switching systems, and is illustrated with a real-world case study.