An automata-theoretic approach to constraint LTL

11 years 9 months ago
An automata-theoretic approach to constraint LTL
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 (Z, <, =) and (N, <, =). Along the way, we give an automata-theoretic proof of a result of [1] when the constraint system satisfies the completion property. Our decision procedures extend easily to handle extensions of the logic with past-time operators and constants, as well as an extension of the temporal language itself to monadic second order logic. Finally we show that the logic becomes undecidable when one considers constraint systems that allow a counting mechanism. Key words: temporal logic, logics of space and time, model-checking
Stéphane Demri, Deepak D'Souza
Added 14 Dec 2010
Updated 14 Dec 2010
Type Journal
Year 2007
Authors Stéphane Demri, Deepak D'Souza
Comments (0)