DMCA
An Automata-Theoretic Approach to Constraint LTL (2003)
| Citations: | 32 - 7 self |
BibTeX
@MISC{Demri03anautomata-theoretic,
author = {S. Demri and D. D'Souza},
title = {An Automata-Theoretic Approach to Constraint LTL},
year = {2003}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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 [BC02] when the constraint system D satisfies the completion property. Our decision procedures extend easily to handle extensions of the logic with past operators and constants, as well as an extension of the temporal language itself to monadic second order logic. Finally, we show that the logic...
