Verification of qualitative ℤ constraints

Lecture Notes in Computer Science

Volumn 3653, Issue , 2005, Pages 518-532

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

^a UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT THEORY;

CONGRUENCES MODULO; CONSTRAINT LANGUAGE; LTL-LIKE LOGIC;

CONCURRENCY CONTROL;

EID: 27244446181     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11539452_39     Document Type: Conference Paper

References (31)

1. [AD94] R. Alur and D. Dill. A theory of timed automata. TCS, 126:183-235, 1994.
2. [AH94] R. Alur and Th. Henzinger. A really temporal logic. JACM, 41(1):181-204, 1994.
3. [BC02] Ph. Balbiani and J.F. Condotta. Computational complexity of prepositional linear temporal logics based on qualitative spatial or temporal reasoning. In FroCoS'02, volume 2309 of LNAI, pages 162-173. Springer, 2002.
4. [BEH95] A. Bouajjani, R. Echahed, and P. Habermehl. On the verification problem of nonregular properties for nonregular processes. In LICS'95, pages 123-133, 1995.
5. [BEM97] 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.
6. [BFLP03] S. Bardin, A. Finkel, J. Leroux, and L. Petrucci. FAST: Fast Acceleration of Symbolic Transition systems. In CAV'03, volume 2725 of LNCS, pages 118-121. Springer, 2003.
7. [Boi98] B. Boigelot. Symbolic methods for exploring infinite state spaces. PhD thesis, Université de Liège, 1998.
8. [Cau03] D. Caucal. On infinite transition graphs having a decidable monadic theory. TCS, 290:79-115, 2003.
9. [CC00] H. Comon and V. Cortier. Flatness is not a weakness. In CSL'00, volume 1862 of LNCS, pages 262-276. Springer, 2000.
10. [Čer94] K. Čerāns. Deciding properties of integral relational automata. In ICALP, volume 820 of LNCS, pages 35-46. Springer, 1994.
11. [CGL94] E. Clarke, O. Grumberg, and D. Long. Model checking and abstraction. ACM Transactions on Programming Languages and Systems, 16(5): 1512-1542, 1994.
12. [CJ98] H. Comon and Y. Jurski. Multiple counters automata, safety analysis and Presburger arithmetic. In CAV'98, volume 1427 of LNCS, pages 268-279. Springer, 1998.
13. [DD03] S. Demri and D. D'Souza. An automata-theoretic approach to constraint LTL. Technical Report LSV-03-11, LSV, August 2003. 40 pages. An extended abstract appeared in Proc. of FSTTCS'02.
14. [Dem04] S. Demri. LTL over integer periodicity constraints. Technical Report LSV-04-6, LSV, February 2004. 35 pages. An extended abstract appeared in Proc. of FOSSACS'04.
15. [DG05] S. Demri and R. Gascon. Verification of qualitative Z-constraints. Tech-nical Report LSV-05-07, LSV, June 2005.
16. [EFM99] J. Esparza, A. Finkel, and R. Mayr. On the verification of broadcast protocols. In LICS'99, pages 352-359, 1999.
17. [FL02] 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.
18. [GK03] P. Gastin and D. Kuske. Satisfiability and model checking for MSO-definable temporal logics are in PSPACE. In CONCUR'03, volume 2761 of LNCS, pages 222-236. Springer, 2003.
19. +03] D. Gabelaia, R. Kontchakov, A. Kurucz, F. Wolter, and M. Za-kharyaschev. On the computational complexity of spatio-temporal logics. In FLAIRS'03, pages 460-464, 2003.
20. [Iba78] O. Ibarra. Reversal-bounded multicounter machines and their decision problems. JACM, 25(1):116-133, 1978.
21. [JKMS04] P. Jancar, A. Kučera, F. Moller, and Z. Sawa. DP lower bounds for equivalence-checking and model-checking of one-counter automata. I & C, (188):1-19, 2004.
22. [LM01] U. Dal Lago and A. Montanari. Calendars, time granularities, and automata. In Int. Symposium on Spatial and Temporal Databases, volume 2121 of LNCS, pages 279-298. Springer, Berlin, 2001.
23. [LS01] G. Logothetis and K. Schneider. Abstraction from counters: an application on real-time systems. In TIME'01, pages 214-223. IEEE, 2001.
24. [Lut04] C. Lutz. NEXPTIME-complete description logics with concrete domains. ACM Transactions on Computational Logic, 5(4):669-705, 2004.
25. [MOS05] M. Müller-Olm and H. Seidl. Analysis of modular arithmetic. In ESOP'05, LNCS. Springer, 2005.
26. [Saf89] S. Safra. Complexity of Automata on Infinite Objects. PhD thesis, The Weizmann Institute of Science, 1989.
27. [SC85] A. Sistla and E. Clarke. The complexity of prepositional linear temporal logic. JACM, 32(3):733-749, 1985.
28. [TC98] D. Toman and J. Chomicki. Datalog with integer periodicity constraints. Journal of Logic Programming, 35(3):263-290, 1998.
29. [VW94] M. Vardi and P. Wolper. Reasoning about infinite computations. I & C, 115:1-37, 1994.
30. [Wol83] P. Wolper. Temporal logic can be more expressive. I & C, 56:72-99, 1983.
31. [WZ00] F. Wolter and M. Zakharyaschev. Spatio-temporal representation and reasoning based on RCC-8. In KR'00, pages 3-14, 2000.