We consider an extension of linear-time temporal logic (LTL) with constraints interpreted over a concrete domain. We use a new automata-theoretic technique to show pspace decidability of the logic for the constraint systems hZ;<; =i and hN; <; =i. Along the way, we give an automata-theoretic proof of a result of [BC02]. We also prove undecidability for LTL over concrete domains that allow a counting mechanism
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.