Verification of qualitative Z constraints

Theoretical Computer Science

Volumn 409, Issue 1, 2008, Pages 24-40

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

^a CNRS   (France)

Author keywords

Arithmetical constraint; B chi automaton; Complexity; Symbolic model; Temporal logic

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTABILITY AND DECIDABILITY; LINGUISTICS; MODEL CHECKING; QUERY LANGUAGES; ROBOTS; TEMPORAL LOGIC; TRANSLATION (LANGUAGES);

AND MODELS; ARITHMETICAL CONSTRAINT; ATOMIC FORMULAS; BOOLEAN OPERATIONS; COMPLEXITY; CONGRUENCES MODULO; CONSTRAINT LANGUAGES; COUNTER AUTOMATONS; POLYNOMIAL SPACES; POWER OF TWOS; PROGRAMMING LANGUAGES; QUALITATIVE CONSTRAINTS; SATISFIABILITY; SYMBOLIC MODEL;

AUTOMATA THEORY;

EID: 55349137344     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.07.023     Document Type: Article

References (51)

1. Alur R., and Dill D. A theory of timed automata. Theoretical Computer Science 126 (1994) 183-235
2. Alur R., and Henzinger Th. A really temporal logic. Journal of the Association for Computing Machinery 41 1 (1994) 181-204
3. Bertino E., Bettini C., Ferrari E., and Samarati P. An access control model supporting periodicity constraints and temporal reasoning. ACM Transactions on Databases Systems 23 3 (1998) 231-285
4. Bouajjani A., Bozga M., Habermehl P., Iosif R., Moro P., and Vojnar T. Programs with lists are counter automata. CAV'06. Lecture Notes in Computer Science vol. 4144 (2006), Springer 517-531
5. Balbiani Ph., and Condotta J.F. Computational complexity of propositional linear temporal logics based on qualitative spatial or temporal reasoning. FroCoS'02. Lecture Notes in Artificial Intelligence vol. 2309 (2002), Springer 162-173
6. Balcázar J., Díaz J., and Gabarró J. Structural Complexity I. 2nd ed. (1988), Springer, Berlin
7. A. Bouajjani, R. Echahed, P. Habermehl, On the verification problem of nonregular properties for nonregular processes, in: LICS'95, 1995, pp. 123-133
8. Bouajjani A., Esparza J., and Maler O. Reachability analysis of pushdown automata: Application to model-checking. CONCUR'97. Lecture Notes in Computer Science vol. 1243 (1997), Springer 135-150
9. Bérard B. Untiming timed languages. Information Processing Letters 55 (1995) 129-135
10. Bardin S., Finkel A., Leroux J., and Petrucci L. Fast: Fast acceleration of symbolic transition systems. CAV'03. Lecture Notes in Computer Science vol. 2725 (2003), Springer 118-121
11. S. Bardin, A. Finkel, E. Lozes, A. Sangnier, From pointer systems to counter systems using shape analysis, in: AVIS'06, 2006
12. Bozzelli L., and Gascon R. Branching-time temporal logic extended with presburger constraints. LPAR'06. Lecture Notes in Computer Science vol. 4246 (2006), Springer 197-211
13. F. Baader, P. Hanschke, A scheme for integrating concrete domains into concept languages, in: IJCAI'91, 1991, pp. 452-457
14. Bozga M., Iosif R., and Lakhnech Y. Flat parametric counter automata. ICALP'06. Lecture Notes in Computer Science vol. 4052 (2006), Springer 577-588
15. B. Boigelot, Symbolic methods for exploring infinite state spaces, Ph.D. Thesis, Université de Liège, 1998
16. Caucal D. On infinite transition graphs having a decidable monadic theory. Theoretical Computer Science 290 (2003) 79-115
17. Comon H., and Cortier V. Flatness is not a weakness. CSL'00. Lecture Notes in Computer Science vol. 1862 (2000), Springer 262-276
18. Čera-ns K. Deciding properties of integral relational automata. ICALP. Lecture Notes in Computer Science vol. 820 (1994), Springer 35-46
19. Clarke E., Grumberg O., and Long D. Model checking and abstraction. ACM Transactions on Programming Languages and Systems 16 5 (1994) 1512-1542
20. Comon H., and Jurski Y. Multiple counters automata, safety analysis and Presburger arithmetic. CAV'98. Lecture Notes in Computer Science vol. 1427 (1998), Springer 268-279
21. A. Chandra, P. Merlin, Optimal implementation of conjunctive queries in relational databases, in: 9th ACM Symposium on Theory of Computing, 1977, pp. 77-90
22. Demri S., and D'Souza D. An automata-theoretic approach to constraint LTL. Information and Computation 205 3 (2007) 380-415
23. Demri S. LTL over integer periodicity constraints. Theoretical Computer Science 360 1-3 (2006) 96-123
24. Demri S., Finkel A., Goranko V., and van Drimmelen G. Towards a model-checker for counter systems. Proceedings of the 4th International Symposium on Automated Technology for Verification and Analysis. ATVA'06. Lecture Notes in Computer Science vol. 4218 (2006), Springer 493-507
25. Demri S., and Gascon R. Verification of qualitative Z-constraints. Proceedings of the 16th International Conference on Concurrency Theory. CONCUR'05. Lecture Notes in Computer Science vol. 3653 (August 2005), Springer 518-532
26. Dang Z., and Ibarra O.H. The existence of ω-chains for transitive mixed linear relations and its applications. International Journal of Foundations of Computer Science 13 6 (2002) 911-936
27. Dang Z., San Pietro P., and Kemmerer R.A. Presburger liveness verification of discrete timed automata. Theoretical Computer Science 1-3 299 (2003) 413-438
28. J. Esparza, A. Finkel, R. Mayr, On the verification of broadcast protocols, in: LICS'99, 1999, pp. 352-359
29. Finkel A., and Leroux J. How to compose Presburger accelerations: Applications to broadcast protocols. FST&TCS'02. Lecture Notes in Computer Science vol. 2256 (2002), Springer 145-156
30. Finkel A., and Sutre G. Decidability of reachability problems for classes of two counters automata. STACS'00. Lecture Notes in Computer Science vol. 2256 (2000), Springer 346-357
31. R. Gascon, Spécification et vérification de propriétés quantitatives sur des automates à contraintes, Ph.D. Thesis, ENS de Cachan, November 2007
32. Gastin P., and Kuske D. Satisfiability and model checking for MSO-definable temporal logics are in PSPACE. CONCUR'03. Lecture Notes in Computer Science vol. 2761 (2003), Springer 222-236
33. D. Gabelaia, R. Kontchakov, A. Kurucz, F. Wolter, M. Zakharyaschev, On the computational complexity of spatio-temporal logics, in: FLAIRS'03, 2003, pp. 460-464
34. Harel E., Lichtenstein O., and Pnueli A. Explicit clock temporal logic. Proc. 5th IEEE Symp. Logic in Computer Science. LICS '90, Philadelphia, PA, USA, June 1990 (1990), IEEE Computer Society Press 400-413
35. Henzinger Th., Majumdar R., and Raskin J.F. A classification of symbolic transitions systems. ACM Transactions on Computational Logic 6 1 (2005) 1-32
36. Ibarra O. Reversal-bounded multicounter machines and their decision problems. Journal of the Association for Computing Machinery 25 1 (1978) 116-133
37. Ibarra O., and Dang Z. On removing the stack from reachability constructions. ISAAC'01. Lecture Notes in Computer Science vol. 2223 (2001), Springer 244-256
38. Jančar P., Kučera A., Moller F., and Sawa Z. DP lower bounds for equivalence-checking and model-checking of one-counter automata. Information and Computation 1 188 (2004) 1-19
39. Dal Lago U., and Montanari A. Calendars, time granularities, and automata. Int. Symposium on Spatial and Temporal Databases. Lecture Notes in Computer Science vol. 2121 (2001), Springer, Berlin 279-298
40. Logothetis G., and Schneider K. Abstraction from counters: an application on real-time systems. TIME'01 (2001), IEEE 214-223
41. Lutz C. NEXPTIME-complete description logics with concrete domains. ACM Transactions on Computational Logic 5 4 (2004) 669-705
42. Minsky M. Computation, Finite and Infinite Machines (1967), Prentice Hall
43. Müller-Olm M., and Seidl H. Analysis of modular arithmetic. ESOP'05. Lecture Notes in Computer Science vol. 3444 (2005), Springer 46-60
44. Muller D., and Schupp P. The theory of ends, pushdown automata, and second-order logic. Theoretical Computer Science 37 (1985) 51-75
45. G. Puppis, Automata for Branching and Layered Temporal Structures, Ph.D. Thesis, University of Udine, 2006
46. Revesz P. Introduction to Constraint Databases (2002), Springer, New York
47. S. Safra, On the complexity of ω-automata, in: Proc. 29th IEEE Symp. on Foundations of Computer Science, 1988, pp. 319-327
48. Sistla A., and Clarke E. The complexity of propositional linear temporal logic. Journal of the Association for Computing Machinery 32 3 (1985) 733-749
49. Vardi M., and Wolper P. Reasoning about infinite computations. Information and Computation 115 (1994) 1-37
50. Wolper P. Temporal logic can be more expressive. Information and Computation 56 (1983) 72-99
51. F. Wolter, M. Zakharyaschev, Spatio-temporal representation and reasoning based on RCC-8, in: KR'00, 2000, pp. 3-14