A Decidable Class of Planar Linear Hybrid Systems

Abstract. The paper shows the decidability of the reachability problem for pla-nar, monotonic, linear hybrid automata without resets. These automata are a spe-cial class of linear hybrid automata with only two variables, whose flows in all states is monotonic along some direction in the plane, and in which the continu-ous variables are not reset on a discrete transition.