The effects of bounding syntactic resources on presburger LTL

Journal of Logic and Computation

Volumn 19, Issue 6, 2009, Pages 1541-1575

  Demri, Stéphane ^a   Gascon, Régis ^b  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b UNIVERSITY OF NICE SOPHIA ANTIPOLIS   (France)

Author keywords

B chi automaton; Linear time temporal logic; One counter automaton; Presburger arithmetic

Indexed keywords

ATOMIC FORMULAE; COMPLEXITY ISSUES; COUNTER AUTOMATA; DIFFERENCE CONSTRAINTS; EMPTINESS PROBLEM; FREE VARIABLE; LINEAR TIME TEMPORAL LOGIC; LOGICAL OPERATORS; MODEL CHECKING PROBLEM; PRESBURGER; PRESBURGER ARITHMETIC; PROPOSITIONAL VARIABLES; PUSHDOWN SYSTEMS; SATISFIABILITY; SATISFIABILITY PROBLEMS; SIGN TEST; TWO-STATE; UPPER BOUND; ZERO TEST;

COMPUTABILITY AND DECIDABILITY; MODEL CHECKING; ROBOTS; SYNTACTICS; TEMPORAL LOGIC; TRANSLATION (LANGUAGES);

AUTOMATA THEORY;

EID: 72649104610     PISSN: 0955792X     EISSN: 1465363X     Source Type: Journal    
DOI: 10.1093/logcom/exp037     Document Type: Article

References (49)

1. R. Alur and D. Dill.Atheory of timed automata. Theoretical Computer Science, 126, 183-235, 1994.
2. R. Alur and T. Henzinger. A really temporal logic. Journal of the Association for Computing Machinery, 41, 181-204, 1994.
3. Ph. Balbiani and J. F. Condotta. Computational complexity of propositional linear temporal logics based on qualitative spatial or temporal reasoning. In Proceedings of the 4th International Workshop on Frontiers of Combining Systems (FroCoS'02), Vol.2309 of Lecture Notes in Artificial Intelligence, pp. 162-173. Springer, 2002.
4. J. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity I. 2nd edn. Springer, 1988.
5. S. Bardin, A. Finkel, E. Lozes, and A. Sangnier. From pointer systems to counter systems using shape analysis. In Proceedings of the 5th International Workshop on Automated Verification of Infinite-State Systems (AVIS'06), 2006.
6. J. Berstel and L. Boasson. Context-free languages. In Handbook of Theoretical Computer Science, Volume B, Formal models and semantics, pp. 59-102. Elsevier, 1990.
7. B. Boigelot. Symbolic Methods for Exploring Infinite State Spaces. PhD Thesis, Université de Liège, Belgium, 1998.
8. A. Bouajjani and P. Habermehl. Constrained properties, semilinear sets, and Petri nets. In Proceedings of the 7th International Conference on Concurrency Theory (CONCUR'96), Vol.1119 of Lecture Notes in Computer Science, pp. 481-497. Springer, 1996.
9. A. Bouajjani, M. Bozga, P. Habermehl, R. Iosif, P. Moro, and T. Vojnar. Programs with lists are counter automata. In Proceedings of the 18th International Conference on Computer Aided Verification (CAV'06), Vol.4144 of Lecture Notes in Computer Science, pp. 517-531. Springer, 2006.
10. A. Bouajjani, R. Echahed, and P. Habermehl. On the verification problem of nonregular properties for nonregular processes. In Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science (LICS'95), pp. 123-133. IEEE, 1995.
11. A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: application to model checking. In Proceedings of the 8th International Conference on Concurrency Theory (CONCUR'97), Vol.1243 of Lecture Notes in Computer Science, pp. 135-150. Springer, 1997.
12. A. Bouajjani, P. Habermehl, and R. Mayr. Automatic verification of recursive procedures with one integer parameter. Theoretical Computer Science, 295, 85-106, 2003.
13. C. Chitic and D. Rosu. On validation ofXMLstreams using finite state machines. In Proceedings of the 7th International Workshop on the Web and Databases (WebDB'04, pp. 85-90, 2004.
14. H. Comon and V. Cortier. Flatness is not a weakness. In Proceedings of the 8th Annual EACSL Conference on Computer Science Logic (CSL'00), Vol.1862 of Lecture Notes in Computer Science, pp. 262-276. Springer, 2000.
15. H. Comon andY. Jurski. Multiple counters automata, safety analysis and Presburger arithmetic. In Proceedings of the 10th International Conference on Computer Aided Verification (CAV'98), Vol.1427 of Lecture Notes in Computer Science, pp. 268-279. Springer, 1998.
16. E. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 2000.
17. Z. Dang, P. San Pietro, and R. Kemmerer. Presburger liveness verification of discrete timed automata. Theoretical Computer Science, 299, 413-438, 2003.
18. S. Demri and D. D'Souza. An automata-theoretic approach to constraint LTL. Information and Computation, 205, 380-415, 2007.
19. S. Demri and R. Gascon. The effects of bounding syntactic resources on Presburger LTL (extended abstract). In Proceedings of the 14th International Symposium on Temporal Representation and Reasoning (TIME'07), pp. 94-104. IEEE, 2007.
20. S. Demri and R. Gascon.Verification of qualitativeZconstraints. Theoretical Computer Science, 409, 24-40, 2008.
21. S. Demri and Ph. Schnoebelen. The complexity of propositional linear temporal logics in simple cases. Information and Computation, 174, 84-103, 2002.
22. J. Esparza, A. Kučera, and S. Schwoon. Model checking LTL with regular valuations for pushdown systems. Information and Computation, 186, 355-376, 2003.
23. A. Finkel and J. Leroux. How to compose Presburger accelerations: Applications to broadcast protocols. In Proceedings of the 22nd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'02), Vol.2256 of Lecture Notes in Computer Science, pp. 145-156. Springer, 2002.
24. A. Finkel, B.Willems, and P.Wolper.Adirect symbolic approach to model checking pushdown systems (extended abstract). In Proceedings of the 2nd International Workshop on Verification of Infinite State Systems (INFINITY'97), Vol.9 of Electronic Notes in Theoretical Computer Science. Elsevier, 1997.
25. D. Gabbay,A. Pnueli, S. Shelah, and J. Stavi. On the temporal analysis of fairness. In 7th Annual ACM Symposium on Principles of Programming Languages, pp. 163-173. ACM Press, 1980.
26. P. Gastin and D. Kuske. Satisfiability and model checking for MSO-definable temporal logics are in PSPACE. In Proceedings of the 14th International Conference on Concurrency Theory (CONCUR'03), Vol.2761 of Lecture Notes in Computer Science, pp. 222-236. Springer, 2003.
27. C. Haase, S. Kreutzer, J. Ouaknine, and J. Worrell. Reachability in succinct and parametric one-counter automata. In Proceedings of the 20th International Conference on Concurrency Theory (CONCUR'09), Lecture Notes in Computer Science. Springer, 2009. To appear.
28. J. Halpern. The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic. Artificial Intelligence, 75, 361-372, 1995.
29. O. Ibarra. Reversal-bounded multicounter machines and their decision problems. Journal of the Association for Computing Machinery, 25, 116-133, 1978.
30. O. Ibarra, J. Su, Z. Dang, T. Bultan, and A. Kemmerer. Counter machines: decidable properties and applications to verification problems. In Proceedings of the 25st International Symposium on Mathematical Foundations of Computer Science (MFCS'00), Vol.1893 of Lecture Notes in Computer Science, pp. 426-435. Springer, 2000.
31. P. Jaňcar, A. Kučera, F. Moller, and Z. Sawa. DP lower bounds for equivalence-checking and model-checking of one-counter automata. Information and Computation, 188, 1-19, 2004.
32. A. Kučera. Efficient verification algorithms for one-counter processes. In Proceedings of the 27th International Colloquium on Automata, Languages and Programming (ICALP'00), Vol.1853 of Lecture Notes in Computer Science, pp. 317-328. Springer, 2000.
33. O. Kupferman, M. Y. Vardi, and P.Wolper. An automata-theoretic approach to branching-time model checking. Journal of the Association for Computing Machinery, 47, 312-360, 2000.
34. P. Lafourcade, D. Lugiez, and R. Treinen. Intruder deduction for AC-like equational theories with homomorphisms. Research Report LSV-04-16. Laboratoire Spécification et Vérification, ENS Cachan, France, 2004. 69
35. P. Lafourcade, D. Lugiez, and R. Treinen. Intruder deduction for AC-like equational theories with homomorphisms. In Proceedings of the 16th International Conference on Rewriting Techniques and Applications (RTA'05), Vol.3467 of Lecture Notes in Computer Science, pp. 308-322. Springer, 2005.
36. F. Laroussinie, N. Markey, and P. Schnoebelen. Model checking timed automata with one or two clocks. In Proceedings of the 15th International Conference on Concurrency Theory (CONCUR'04), Vol.3170 of Lecture Notes in Computer Science, pp. 387-401. Springer, 2004.
37. S. Lasota and I. Walukiewicz. Alternating timed automata. In Proceedings of the 8th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'05), Vol.3441 of Lecture Notes in Computer Science. Springer, 2005.
38. C. Lutz. NEXPTIME-complete description logics with concrete domains. ACM Transactions on Computational Logic, 5, 669-705, 2004.
39. M. Minsky. Computation, Finite and Infinite Machines. Prentice Hall, 1967.
40. J. Ouaknine and J. Worrell. On the decidability of metric temporal logic. In Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science (LICS'05), pp. 188-197. IEEE, 2005.
41. H. Rogers, Jr. Theory of Recursive Functions and Effective Computability. McGraw-Hill Book Company, 1967.
42. L. Rosier and H.-C. Yen. A multiparameter analysis of the boundedness problem for vector addition systems. Journal of Computer and System Sciences, 32, 105-135, 1986.
43. O. Serre. Parity games played on transition graphs of one-counter processes. In Proceedings of the 9th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'06), Vol.3921 of Lecture Notes in Computer Science, pp. 337-351. Springer, 2006.
44. A. Sistla and E. Clarke. The complexity of propositional linear temporal logic. Journal of the Association for Computing Machinery, 32, 733-749, 1985.
45. M. Vardi. A temporal fixpoint calculus. In Conference Record of the Fifteenth Annual ACM Symposium on Principles of Programming Languages (POPL'88), pp. 250-259. ACM, 1988.
46. M. Vardi and P.Wolper. Reasoning about infinite computations. Information and Computation, 115, 1-37, 1994.
47. M.Wakatsuki, K.Teraguchi, and E.Tomita. Polynomial time identification of strict deterministic restricted one-counter automata in some class from positive data. In Proceedings of the 7th International Colloquium on Grammatical Inference (ICGI'04), Vol.3264 of Lecture Notes in Artificial Intelligence, pp. 260-272. Springer, 2004.
48. I. Walukiewicz. Pushdown processes: games and model-checking. Information and Computation, 164, 234-263, 2001.
49. P. Wolper. Temporal logic can be more expressive. Information and Computation, 56, 72-99, 1983.