Linear-Time temporal logics with presburger constraints: An overview

Journal of Applied Non-Classical Logics

Volumn 16, Issue 3-4, 2006, Pages 311-347

  Demri, Stéphane ^a  

^a CNRS   (France)

Author keywords

B chi automaton; Computational complexity; Presburger arithmetic; Temporal logic

Indexed keywords

EID: 35148882373     PISSN: 11663081     EISSN: 19585780     Source Type: Journal    
DOI: 10.3166/jancl.16.311-347     Document Type: Conference Paper

References (109)

1. ABADI M., "The power of temporal proofs", Theoretical Computer Science,vol. 65, 1989, p.
2. ALUR R., DILL D., "A theory of timed automata", Theoretical Computer Science,vol. 126, 1994, p. 183-235
3. ALUR R., HENZINGER T., "A really temporal logic", Journal of the Association for Computing Machinery, vol. 41, num. 1, 1994, p. 181-204
4. ALUR R., FEDER T., HENZINGER T., "The benefits of relaxing punctuality", Journal of the Association for Computing Machinery, vol. 43, 1996, p. 116-146
5. BAADER F., HANSCHKE P., "A scheme for integrating concrete domains into concept languages", 12th International Joint Conference on Artificial Intelligence, Sydney,Australia, 1991, p. 452-457
6. BALBIANI P., CONDOTTA J., "Computational Complexity of propositional linear temporal logics based on qualitative spatial or temporal reasoning", ARMANDO A., Ed., Frontiers of Combining Systems (FroCoS'02), vol. 2309 of Lecture Notes in Artificial Intelligence, Springer, Berlin, 2002, p. 162-173
7. BARNABA M. F., CARO F. D., "Graded Modalities", Studia Logica, vol. 44, num. 2, 1985, p. 197-221
8. BERTINO E., BETTINI C., FERRARI E., SAMARATI P., "Supporting Periodic Authorizations and Temporal Reasoning in Database Access Control", 22nd VLDB, Bombay, India, 1996, p. 472-483
9. BÉRARD B., BIDOIT M., FINKEL A., LAROUSSINIE F., PETIT A., PETRUCCI L., SCHNOEBELEN P., Systems and Software Verification, Model-Checking Techniques and Tools, Springer-Verlag, 2001
10. BOIGELOT B., "Symbolic methods for exploring infinite state spaces", PhD thesis, Université de Liège, 1998
11. BOIGELOT B., WOLPER P., "Representing arithmetic constraints with finite automata: an overview", STUCKEY P., Ed., ICLP 2002, vol. 2401 of Lecture Notes in Computer Science, Springer, 2002, p. 1-19
12. BOJAŃCZYK M., MUSCHOLL A., SCHWENTICK T., SEGOUFIN L., DAVID C., "Two-variable logic on words with data", LICS'06, IEEE, 2006, p. 7-16
13. BONEVA I., TALBOT J., "Automata and Logics for Unranked and Unordered Trees", RTA'05, vol. 3467 of Lecture Notes in Computer Science, 2005, p. 500-515
14. BOUAJJANI A., ECHAHED R., HABERMEHL P., "On the verification problem of nonregular properties for nonregular processes", LICS'95, 1995, p. 123-133
15. BOUAJJANI A., HABERMEHL P., "Constrained Properties, Semilinear Sets, And Petri Nets", CONCUR'96, vol. 1119 of Lecture Notes in Computer Science, Springer, 1996, p. 481-497
16. BOUAJJANI A., ESPARZA J., MALER O., "Reachability Analysis of Pushdown Automata: Application to Model Checking", CONCUR'97, vol. 1243 of LNCS, Springer, 1997, p. 135-150
17. BOZZELLI L., GASCON R., "Branching-time temporal logic extended with Presburger constraints", LPAR'06, Lecture Notes in Computer Science, Springer, 2006, to appear
18. BRESOLIN D., MONTANARI A., PUPPIS G., "Time Granularities and Ultimately Periodic Automata", JELIA'04, vol. 3229 of Lecture Notes in Computer Science, Springer, 2004, p. 513-525
19. BRUYÈRE V., DALLÓLIO E., RASKIN J., "Durations, ParametricModel-Checking in Timed Automata with Presburger Arithmetic", STACS'03, vol. 2607 of Lecture Notes in Computer Science, Springer, 2003, p. 687-698
20. BULTAN T., GERBER R., PUGH W., "Symbolic model checking of infinite state systems using Presburger arithmetic", CAV'97, vol. 1254 of Lecture Notes in Computer Science, Springer, 1997, p. 400-411
21. CALVANESE D., GIACOMO G. D., "Expressive Description Logics", Description Logics Handbook, Cambridge University Press, 2005, p. 178-218
22. TEN CATE B., FRANCESCHET M., "On the complexity of hybrid logics with binders", CSL'05, vol. 3634 of Lecture Notes in Computer Science, Springer, 2005, p. 339-354
23. ČERaNS K., "Deciding Properties of Integral Relational Automata", ICALP-21, vol. 820 of Lecture Notes in Computer Science, Springer, Berlin, 1994, p. 35-46
24. CERRITO S., MAYER M. C., PRAUD S., "First-Order Linear Temporal Logic over Finite Time Structures", GANZINGER H., MCALLESTER D., VORONKOV A., Eds., 6th Int. Conference on Logic Programming and Automated Reasoning, Tbilisi, Republic of Georgia (LPAR'99), vol. 1705 of Lecture Notes in Computer Science, Springer, 1999, p. 62-76
25. CHITIC C., ROSU D., "On validation of XML streams using finite state machines", WebDB, Paris, 2004, p. 85-90
26. COMON H., JURSKI Y., "Multiple counters automata, safety analysis and Presburger arithmetic", HU A., VARDI M., Eds., Proc. Computer Aided Verification, Vancouver, vol. 1427 of Lecture Notes in Computer Science, Springer, Berlin, 1998, p. 268-279
27. COMON H., CORTIER V., "Flatness is not a weakness", 14 Int. Workshop Computer Science Logic, vol. 1862 of Lecture Notes in Computer Science, Springer-Verlag, 2000, p. 262-276
28. COMBI C., FRANCESCHET M., PERON A., "A logical approach to represent and reason about calendars", Int. Symposium on Temporal Representation and Reasoning, IEEE Computer Society Press, 2002, p. 134-140
29. CORTIER V., "About the Decision of Reachability for Register Machines", Theoretical Informatics and Applications, vol. 36, num. 4, 2002, p. 341-358
30. *: separating the expressive and distinguishing powers", Logic Journal of the IGPL, vol. 7, num. 1, 1999, p. 55-78
31. DANG Z., PIETRO P. S., KEMMERER R., "Presburger Liveness Verification of Discrete Timed Automata", Theoretical Computer Science, vol. 299, 2003, p. 413-438
32. DAVID C., "Mots et données infinies", Master's thesis, LIAFA, 2004
33. DECHTER R., "From local to global consistency", Artificial Intelligence, vol. 55, 1992, p. 87-107
34. DEGTYAREV A., FISHER M., LISITSA A., "Equality and monodic first-order temporal logic", Studia Logica, vol. 72, 2002, p. 147-156
35. DEMRI S., D'SOUZA D., "An automata-theoretic approach to constraint LTL", AGRAWAL M., SETH A., Eds., FST&TCS'02, Kanpur, vol. 2556 of Lecture Notes in Computer Science, Springer, Berlin, 2002, p. 121-132
36. DEMRI S., D'SOUZA D., "An automata-theoretic approach to constraint LTL", report num. LSV-03-11, August 2003, LSV, 40 pages. Extended version of [DEM 02]. Under submission
37. DEMRI S., "LTL over Integer Periodicity Constraints (Extended Abstract)", WALUKIEWICZ I., Ed., FOSSACS'04, vol. 2987 of Lecture Notes in Computer Science, Springer, Berlin, 2004, p. 121-135
38. DEMRI S., GASCON R., "Verification of Qualitative Z-Constraints", ABADI M., DE L. ALFARO, Eds., Proceedings of the 16th International Conference on Concurrency Theory (CONCUR'05), vol. 3653 of Lecture Notes in Computer Science, San Francisco, CA, USA, Aug. 2005, Springer, p. 518-532
39. DEMRI S., LAZIĆ R., NOWAK D., "On the freeze quantifier in constraint LTL: decidability and complexity", 12th Int. Symp. on Temporal Representation and Reasoning, Burlington, Vermont, IEEE Computer Society Press, 2005, p. 113-121
40. DEMRI S., NOWAK D., "Reasoning about transfinite sequences (extended abstract)", ATVA'05, vol. 3707 of Lecture Notes in Computer Science, Springer, 2005, p. 248-262
41. DEMRI S., "LTL over integer periodicity constraints", Theoretical Computer Science, vol. 360, num. 1-3, 2006, p. 96-123
42. DEMRI S., FINKEL A., GORANKO V., VAN DRIMMELEN G., "Towards a modelchecker for counter systems", Proceedings of the 4th International Symposium on Automated Technology for Verification and Analysis (ATVA'06), vol. 4218 of Lecture Notes in Computer Science, Beijing, ROC, 2006, Springer, p. 493-507
43. DEMRI S., GASCON R., "The effects of bounding syntactic resourses on Presburger LTL", report num. LSV-06-5, 2006, LSV, 36 pages
44. DEMRI S., LAZIĆ R., "LTL with the freeze quantifier and register automata", LICS'06, IEEE, 2006, p. 17-26
45. DEMRI S., LAZIĆ R., NOWAK D., "On the freeze quantifier in constraint LTL: decidability and complexity", Information and Computation, vol. to appear, 2006, Extended version of [DEM 05b]
46. DEMRI S., LUGIEZ D., "Presburger Modal Logic is PSPACE- complete", 3rd International Joint Conference on Automated Reasoning (IJCAR'06), Seattle, vol. 4130 of Lecture Notes in Computer Science, Springer, 2006, p. 541-556
47. DEUTSCH A., SUI L., VIANU V., "Specification and verification of data-driven web services", PODS'04, Paris, 2004, p. 71-82
48. FINE K., "In so many possible worlds", Notre Dame Journal of Formal Logic, vol. 13, num. 4, 1972, p. 516-520
49. FINKEL A., WILLEMS B., WOLPER P., "A Direct Symbolic Approach to Model Checking Pushdown Systems (Extended Abstract)", INFINITY'97, vol. 9 of ENTCS, Elsevier Science, 1997
50. FINKEL A., SUTRE G., "Decidability of reachability problems for classes of two counters automata", 17th Ann. Symp. Theoretical Aspects of Computer Science, vol. 2256 of Lecture Notes in Computer Science, Springer-Verlag, 2000, p. 346-357
51. FINKEL A., LEROUX J., "How to compose Presburger accelerations: Applications to broadcast protocols", AGRAWAL M., SETH A., Eds., FST&TCS'02, Kanpur, vol. 2256 of Lecture Notes in Computer Science, Springer, Berlin, 2002, p. 145-156
52. FISCHER M., RABIN M., "Super-exponential complexity of Presburger arithmetic", KARP R., Ed., Complexity of Computation, vol. 7 of SIAM-AMS proceedings, American Mathematical Society, 1974, p. 27-42
53. FITTING M., "Modal logic between propositional and first-order", Journal of Logic and Computation, vol. 12, num. 6, 2002, p. 1017-1026
54. FRENCH T., "Quantified Propositional Temporal Logic with Repeating States", TIME-ICTL 2003, IEEE Computer Society, 2003, p. 155-165
55. GABBAY D., KURUCZ A., WOLTER F., ZAKHARYASCHEV M., Manydimensional modal logics: theory and practice, Cambridge University Press, 2003
56. GABELAIA D., KONTCHAKOV R., KURUCZ A., WOLTER F., ZAKHARYASCHEV M., "On the computational complexity of spatio-temporal logics", FLAIRS'03, St Augustine, Florida, 2003, p. 460-464
57. GASTIN P., KUSKE D., "Satisfiability and model checking for MSO-definable temporal logics are in PSPACE", CONCUR'03, vol. 2761 of Lecture Notes in Computer Science, Springer, 2003, p. 222-236
58. GASCON R., "Verifying qualitative and quantitative properties with LTL over concrete domains", Proceedings of the 4th Workshop on Methods for Modalities (M4M'05), vol. 194 of Informatik Bericht, Humboldt Universität zu Berlin, 2005, p. 54-61
59. GINSBURG S., SPANIER E., "Semigroups, Presburger formulas and languages", Pacific Journal of Mathematics, vol. 16, num. 2, 1966, p. 285-296
60. HENZINGER T., "Half-order modal logic: how to prove real-time properties", 9th Annual ACM Symposium on Principles of Distributed Computing, ACM Press, 1990, p. 281-296
61. HIRSHFELD Y., RABINOVICH A., "Future temporal logic needs infinitely many modalities", Information and Computation, vol. 187, num. 2, 2003, p. 196-208
62. HIRSHFELD Y., RABINOVICH A., "Logics for real time: decidability and complexity", Fundamenta Informaticae, vol. 62, 2004, p. 1-28
63. HODKINSON I., KONTCHAKOV R., KURUCZ A., WOLTER F., ZAKHARYASCHEV M., "On the computational complexity of decidable fragments of first-order linear temporal logics", 10th Int. Symp. Temporal Representation and Reasoning and 4th Int. Conf. Temporal Logic (TIME-ICTL), IEEE, 2003, p. 91-98
64. VAN DER HOEK W., DE RIJKE M., "Counting objects", Journal of Logic and Computation, vol. 5, num. 3, 1995, p. 325-345
65. HOLLUNDER B., BAADER F., "Qualifying number restrictions in concept languages", KR'91, 1991, p. 335-346
66. IBARRA O., "Reversal-bounded multicounter machines and their decision problems", Journal of the Association for Computing Machinery, vol. 25, num. 1, 1978, p. 116-133
67. IBARRA O., SU J., DANG Z., BULTAN T., KEMMERER A., "Counter Machines: Decidable Properties and Applications to Verification Problems", MFCS'00, vol. 1893 of Lecture Notes in Computer Science, Springer, 2000, p. 426-435
68. IBARRA O., DANG Z., "On removing the stack from reachability constructions", EADES P., TAKAOKA T., Eds., International Symposium on Algorithms and Computation (ISAAC'01), vol. 2223 of Lecture Notes in Computer Science, Springer, 2001, p. 244-256
69. KAMP J., "Tense Logic and the theory of linear order", PhD thesis, UCLA, USA, 1968
70. KRÖGER F., "On the interpretability of arithmetic in temporal logic", Theoretical Computer Science, vol. 73, 1990, p. 47-61
71. LAFOURCADE P., LUGIEZ D., TREINEN R., "Intruder deduction for AC-like equational theories with homomorphisms", RTA'05, vol. 3467 of Lecture Notes in Computer Science, Springer, 2005, p. 308-322
72. LAGO U. D., MONTANARI A., "Calendars, time granularities, and automata", Int. Symposium on Spatial and Temporal Databases, vol. 2121 of Lecture Notes in Computer Science, Springer, Berlin, 2001, p. 279-298
73. LAGO U. D., MONTANARI A., PUPPIS G., "Towards compact and tractable automaton-based representations of time granularities", ICTCS 2003, vol. 2841 of Lecture Notes in Computer Science, Springer, Berlin, 2003, p. 72-85
74. LEROUX J., SUTRE G., "Flat counter systems are everywhere!", ATVA'05, vol. 3707 of Lecture Notes in Computer Science, Springer, 2005, p. 489-503
75. LICHTENSTEIN O., PNUELI A., "Propositional Temporal Logics: Decidability and Completeness", Logic Journal of the IGPL, vol. 8, num. 1, 2000, p. 55-85
76. LISITSA A., POTAPOV I., "Temporal logic with predicate λ-abstraction", 12th Int. Symp. on Temporal Representation and Reasoning, Burlington, Vermont, IEEE Computer Society Press, 2005, p. 147-155
77. LUTZ C., "Description Logics with Concrete Domains-A Survey", Advances in Modal Logics Volume 4, King's College Publications, 2003, p. 265-296
78. LUTZ C., "NEXPTIME-complete description logics with concrete domains", ACM Transactions on Computational Logic, vol. 5, num. 4, 2004, p. 669-705
79. LUTZ C., MILIČIć M., "A Tableau algorithm for description logics with concrete domains and GCIs", TABLEAUX'05, vol. 3702 of Lecture Notes in Computer Science, Springer, 2005, p. 201-216
80. LUTZ C., WALTHER D., WOLTER F., "Quantitative temporal logics: PSPACE and below", TIME'05, 2005, p. 138-146
81. MINSKY M., Computation, Finite and Infinite Machines, Prentice Hall, 1967
82. MÜ LLER-OLM M., SEIDL H., "Analysis of Modular Arithmetic", ESOP'05, vol. 3444 of Lecture Notes in Computer Science, Springer, 2005, p. 46-60
83. NIEZETTE M., STEVENNE J., "An efficient symbolic representation of periodic time", Proc. of the International Conference on Information and Knowledge Management, Baltimore, Maryland, vol. 752 of Lecture Notes in Computer Science, Springer, 1992, p. 161-168
84. OHSAKI H., TALBOT J., TISON S., ROOS Y., "Monotone AC-Tree Automata", 12th International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR'05), Montego Bay (Jamaica), vol. 3835 of Lecture Notes in Artificial Intelligence, Springer, 2005, p. 337-351
85. PACUIT E., SALAME S., "Majority logic", KR'04, AAAI Press, 2004, p. 598-605
86. PNUELI A., "The temporal logic of programs", 18th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, 1977, p. 46-57
87. POTAPOV I., "From Post Systems to the Reachability Problems for Matrix Semigroups and Multicounter Automata", DTL'04, vol. 3340 of Lecture Notes in Computer Science, Springer, 2004, p. 345-356
88. PRESBURGER M., "Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt", Comptes Rendus du premier congrès de mathématiciens des Pays Slaves, Warszawa, 1929, p. 92-101
89. PUPPIS G., "Automata for branching and layered temporal structures", PhD thesis, Universitá Degli Studi Di Udine, March 2006
90. REVESZ P., Introduction to Constraint Databases, Springer, New York, 2002
91. REYNOLDS M., "The complexity of the temporal logic with until over general linear time", Journal of Computer and System Sciences, vol. 66, num. 2, 2003, p. 393-426
92. SCHNOEBELEN P., "Verifying lossy channel systems has nonprimitive recursive complexity", Information Processing Letters, vol. 83, num. 5, 2002, p. 251-261
93. SCHNOEBELEN P., "The complexity of temporal logic model checking", Advances in Modal Logic, vol. 4, selected papers from 4th Conf. Advances in Modal Logic (AiML'2002), Sep.-Oct. 2002, Toulouse, France, King's College Publication, 2003, p. 437-459
94. SCHRÖDER L., PATTINSON D., "PSPACE bounds for rank-1 modal logics", LICS'06, IEEE, 2006, p. 231-240
95. SEIDL H., SCHWENTICK T., MUSCHOLL A., HABERMEHL P., "Counting in Trees for free", ICALP'04, vol. 3142 of Lecture Notes in Computer Science, 2004, p. 1136-1149, Long version available at http://www.mathematik.uni-marburg. de/̃tick/
96. SERRE O., "Contribution à l'étude des jeux sur des graphes de processus de pile", PhD thesis, Université Paris 7 - Denis Diderot, 2004
97. SERRE O., "Parity games played on transition graphs of one-counter processes", FOSSACS'06, vol. 3921 of Lecture Notes in Computer Science, Springer, 2006, p. 337-351
98. SISTLA A., CLARKE E., "The complexity of propositional linear temporal logic", Journal of the Association for Computing Machinery, vol. 32, num. 3, 1985, p. 733-749
99. TOMAN D., CHOMICKI J., "DATALOG with integer periodicity constraints", Journal of Logic Programming, vol. 35, num. 3, 1998, p. 263-290
100. TRAHTENBROT B., "Impossibility of an algorithm for the decision problem in finite classes", AmericanMathematical Society - Translation Series, vol. 23, num. 2, 1963, p. 1-5
101. VARDI M., "A temporal fixpoint calculus", 15th Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, San Diego, ACM, 1988, p. 250-259
102. VARDI M., WOLPER P., "Reasoning about Infinite Computations", Information and Computation, vol. 115, 1994, p. 1-37
103. WAKATSUKI M., TERAGUCHI K., TOMITA E., "Polynomial time identification of strict deterministic restricted one-counter automata in some class from positive data", International Colloquium on Grammatical Inference (ICGI 2004), Athens, vol. 3264 of Lecture Notes in Artificial Intelligence, Springer, 2004, p. 260-272
104. WALUKIEWICZ I., "Pushdown processes: games and model-checking", Information and Computation, vol. 164, num. 2, 2001, p. 234-263
105. WIJSEN J., "A string based-model for infinite granularities", AAAI Workshop on Spatial and Temporal Granularity, AAAI Press, 2000, p. 9-16
106. WOLPER P., "Temporal logic can be more expressive", Information and Computation, vol. 56, 1983, p. 72-99
107. WOLTER F., ZAKHARYASCHEV M., "Spatio-temporal representation and reasoning based on RCC-8", KR'00, 2000, p. 3-14
108. WOLTER F., ZAKHARYASCHEV M., "Axiomatizing the monodic fragment of firstorder temporal logic", Annals of Pure and Applied Logic, vol. 118, num. 133-145, 2002
109. ZILIO S. D., LUGIEZ D., "XML schema, tree logic and sheaves automata", Applicable Algebra in Engineering, Communication and Computing (AAECC), vol. to appear, 2006