The effects of bounding syntactic resources on presburger LTL

Proceedings of the International Workshop on Temporal Representation and Reasoning

Volumn , Issue , 2007, Pages 94-104

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

^a UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEXITY ISSUES; COUNTER AUTOMATA; INTERNATIONAL SYMPOSIUM; LOGICAL OPERATORS; MODEL CHECKING (MC); PRESBURGER; PRESBURGER ARITHMETIC; STRENGTH (IGC: D5/D6); UPPER BOUNDS;

CANNING; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTABILITY AND DECIDABILITY; MODEL CHECKING; SYNTACTICS; TESTING; TRANSLATION (LANGUAGES);

AUTOMATA THEORY;

EID: 47349099769     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/TIME.2007.63     Document Type: Conference Paper

References (34)

1. R. Alur and T. Henzinger. A really temporal logic. JACM, 41(1):181-204, 1994.
2. P. Balbiani and J. Condotta. Computational complexity of propositional linear temporal logics based on qualitative spatial or temporal reasoning. In FROCOS'02, volume 2309 of LNAI, pages 162-173. Springer, 2002.
3. S. Bardin, A. Finkel, E. Lozes, and A. Sangnier. From pointer systems to counter systems using shape analysis. In AVIS'06, 2006.
4. A. Biere, A. Cimatti, E. Clarke, O. Strichman, and Y. Zhu. Bounded model checking. In vol. 58 of Advances in Computers. Academic Press, 2003. To appear.
5. B. Boigelot. Symbolic methods for exploring infinite state spaces. PhD thesis, Université de Liège, 1998.
6. A. Bouajjani, M. Bozga, P. Habermehl, R. Iosif, P. Moro, and T. Vojnar. Programs with lists are counter automata. In CAV'06, volume 4144 of LNCS, pages 517-531. Springer, 2006.
7. A. Bouajjani, R. Echahed, and P. Habermehl. On the verification problem of nonregular properties for nonregular processes. In LICS'95, pages 123-133, 1995.
8. A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Application to model checking. In CONCUR'97, volume 1243 of LNCS, pages 135-150. Springer, 1997.
9. C. Chitic and D. Rosu. On validation of XML streams using .nite state machines. In WebDB, Paris, pages 85-90, 2004.
10. H. Comon and V. Cortier. Flatness is not a weakness. In CSL'00, volume 1862 of LNCS, pages 262-276. Springer, 2000.
11. Z. Dang, P. S. Pietro, and R. Kemmerer. Presburger liveness verification of discrete timed automata. TCS, 299:413-438, 2003.
12. S. Demri and D. D'Souza. An automata-theoretic approach to constraint LTL. I & C, 205(3):380-415, 2007.
13. S. Demri and R. Gascon. Verification of qualitative ℤ-constraints. In CONCUR'05, volume 3653 of LNCS, pages 518-532. Springer, 2005.
14. S. Demri and R. Gascon. The effects of bounding syntactic resources on Presburger LTL. Technical Report LSV-06-5, LSV, 2006.
15. S. Demri and P. Schnoebelen. The complexity of propositional linear temporal logics in simple cases. I & C, 174(1):84-103, 2002.
16. A. Finkel and J. Leroux. How to compose Presburger accelerations: Applications to broadcast protocols. In FST&TCS'02, volume 2256 of LNCS, pages 145-156. Springer, 2002.
17. A. Finkel and G. Sutre. Decidability of reachability problems for classes of two counters automata. In STACS'00, volume 2256 of LNCS, pages 346-357. Springer, 2000.
18. A. Finkel, B. Willems, and P. Wolper. A direct symbolic approach to model checking pushdown systems (extended abstract). In INFINITY'97, volume 9 of ENTCS, pages 27-39. Elsevier Science, 1997.
19. O. Ibarra, J. Su, Z. Dang, T. Bultan, and A. Kemmerer. Counter machines: Decidable properties and applications to verification problems. In MFCS'00, volume 1893 of LNCS, pages 426-435. Springer, 2000.
20. O. Kupferman, M. Y. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking. JACM, 47(2):312-360, 2000.
21. P. Lafourcade, D. Lugiez, and R. Treinen. Intruder deduction for AC-like equational theories with homomorphisms. In RTA'05, volume 3467 of LNCS, pages 308-322. Springer, 2005.
22. F. Laroussinie, N. Markey, and P. Schnoebelen. Model checking timed automata with one or two clocks. In CONCUR' 04, volume 3170 of LNCS, pages 387-401. Springer, 2004.
23. S. Lasota and I. Walukiewicz. Alternating timed automata. In FOSSACS'05, volume 3441 of LNCS, pages 250-265. Springer, 2005.
24. J. Leroux and G. Sutre. Flat counter systems are everywhere! In ATVA'05, volume 3707 of LNCS, pages 489-503. Springer, 2005.
25. C. Lutz. NEXPTIME-complete description logics with concrete domains. ACM Transactions on Computational Logic, 5(4):669-705, 2004.
26. M. Minsky. Computation, Finite and Infinite Machines. Prentice Hall, 1967.
27. J. Ouaknine and J. Worrell. On the decidability of metric temporal logic. In LICS'05, pages 188-197, 2005.
28. O. Serre. Parity games played on transition graphs of one-counter processes. In FOSSACS'06, volume 3921 of LNCS, pages 337-351. Springer, 2006.
29. A. Sistla and E. Clarke. The complexity of propositional linear temporal logic. JACM, 32(3):733-749, 1985.
30. M. Vardi. A temporal fixpoint calculus. In POPL'88, pages 250-259. ACM, 1988.
31. M. Vardi and P. Wolper. Reasoning about infinite computations. I & C, 115:1-37, 1994.
32. M. Wakatsuki, K. Teraguchi, and E. Tomita. Polynomial time identi.cation of strict deterministic restricted one-counter automata in some class from positive data. In ICGI'04, volume 3264 of LNAI, pages 260-272. Springer, 2004.
33. I. Walukiewicz. Pushdown processes: games and model-checking. I & C, 164(2):234-263, 2001.
34. P. Wolper. Temporal logic can be more expressive. I & C, 56:72-99, 1983.