Skip to main content
Article thumbnail
Location of Repository

An Automata-Theoretic Approach to Constraint LTL

By Stéphane Demri and Deepak D&apos


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

Topics: logic in computer science, temporal logic, logics of space and time, model-checking
Year: 2002
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.