Reachability computation for linear hybrid systems

Abstract

Linear hybrid systems are finite state machines with linear vector fields of the form ẋ = Ax in each discrete location. Very recently, the reachability problem for classes of linear hybrid systems was shown to be decidable. In this paper, the decidability result is extended to capture classes of linear hybrid systems where in each location the dynamics are of the form ẋ = Ax + Bu , for various types of inputs.