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 (ℤ,<, =) and (ℕ,<, =).We also give an automata-theoretic proof of a result of Balbiani and Condotta [BC02] for constraint systems that satisfy a “completion” property.
Part of this work was done during this author’s visit to LSV, ENS-Cachan.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. F. Allen. Maintaining knowledge about temporal intervals. Communications of the ACM, 26(11):832–846, 1983.
Ph. Balbiani and J.F. Condotta. Computational complexity of propositional linear temporal logics based on qualitative spatial or temporal reasoning. In Frontiers of Combining Systems (FroCoS’02), pages 162–176, 2002.
H. Comon and V. Cortier. Flatness is not a weakness. In 14 Int. Workshop Computer Science Logic, pages 262–276. LNCS, vol. 1862. Springer, 2000.
S. Demri and D. D’souza. An automata-theoretic approach to constraint LTL. CMI Internal Report TCS-02-01, 2002. http://www.cmi.ac.in.
A. Pnueli. The temporal logic of programs. In Proc. 18th IEEE Symposium on Foundation of Computer Science, pages 46–57, 1977.
D. Randell, Z. Cui, and A. Cohn. A spatial logic based on regions and connection. In 3rd Conference on Knowledge Representation and Reasoning, pages 165–176. Morgan Kaufman, 1992.
S. Safra. On the complexity of ω-automata. Proc. 29th IEEE Symp. on Foundations of Computer Science, pages 319–327, 1988.
P. Sistla and E. M. Clarke. The complexity of propositional linear temporal logics. JACM, 32(3):733–749, 1985.
W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B. Elsevier, 1990.
M. Vardi and P. Wolper. An automata theoretic approach to automatic program verification. In Logic in Computer Science, pages 332–334. IEEE, 1986.
F. Wolter and M. Zakharyaschev. Spatio-temporal representation and reasoning based on RCC-8. In KR’00, pages 3–14. Morgan Kaufmann, 2000.
F. Wolter and M. Zakharyaschev. Qualitative spatio-temporal representation and reasoning: a computational perspective. In Exploring Artificial Intelligence in the New Millenium, 2002. To appear.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Demri, S., D’souza, D. (2002). An Automata-Theoretic Approach to Constraint LTL. In: Agrawal, M., Seth, A. (eds) FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2002. Lecture Notes in Computer Science, vol 2556. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36206-1_12
Download citation
DOI: https://doi.org/10.1007/3-540-36206-1_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00225-3
Online ISBN: 978-3-540-36206-7
eBook Packages: Springer Book Archive