On complexity of model-checking for the TQL logic

IFIP Advances in Information and Communication Technology

Volumn 155, Issue , 2004, Pages 381-394

  Boneva, Iovka ^a,b   Talbot, Jean Marc ^a,b  

^a ECOLE CENTRALE DE LILLE   (France)

^b INRIA team Mostrare   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; QUERY LANGUAGES;

COMBINED COMPLEXITY; DATA COMPLEXITY; MODEL CHECKING PROBLEM; POLYNOMIAL HIERARCHIES; POLYNOMIAL-SPACE MODEL; PSPACE-COMPLETE; TREE LOGIC;

MODEL CHECKING;

EID: 26844515981     PISSN: 18684238     EISSN: None     Source Type: Book Series    
DOI: 10.1007/1-4020-8141-3_30     Document Type: Conference Paper

References (14)

1. [Abiteboul et al., 2000] Abiteboul, S., Buneman, P., and Suciu, D. (2000). Data on the Web. Morgan Kaufmann Publishers.
2. [Cardelli, 2000] Cardelli, L. (2000). Semistructured Computation. In 7th International Workshop on Database Programming Languages, DBPL'99, LNCS, pages 1-16. Springer.
3. [Cardelli and Ghelli, 2001] Cardelli, L. and Ghelli, G. (2001). A Query Language Based on the Ambient Logic. In European Symposium on Programming (ESOP'01), volume 2028 of LNCS, pages 1-22. Springer.
4. [Cardelli and Gordon, 2000a] Cardelli, L. and Gordon, A.D. (2000a). Anytime, Anywhere: Modal Logics for Mobile Ambients. In 27th ACM Symposium on Principles of Programming Languages (POPL'00), pages 365-377.
5. [Cardelli and Gordon, 2000b] Cardelli, L. and Gordon, A.D. (2000b). Mobile Ambients. Theoretical Computer Science, 240:177-213.
6. [Charatonik et al., 2001] Charatonik, W., Dal Zilio, S., Gordon, A. D., Mukhopadhyay, S., and Talbot, J.-M. (2001). The Complexity of Model Checking Mobile Ambients. In Foundations of Software Science and Computation Structures (FoSSaCS'01), volume 2030 of LNCS, pages 152-167. Springer.
7. [Courcelle, 1990a] Courcelle, B. (1990a). Graph Rewriting: An Algebraic and Logic Approach. In Handbook of Theoretical Computer Science, volume B. Elsevier.
8. [Courcelle, 1990b] Courcelle, B. (1990b). The Monadic Second-Order Logic of Graphs. I. Recognizable Sets of Finite Graphs. Information and Computatution, 85(1): 12-75.
9. [Dal-Zilio and Lugiez, 2003] Dal-Zilio, S. and Lugiez, D. (2003). XML Schema, Tree Logic and Sheaves Automata. In Rewriting Techniques and Applications, 14th International Conference, RTA 2003, LNCS, pages 246-263. Springer.
10. [Neven, 2002] Neven, F. (2002). Automata, Logic and XML. In Annual Conference of the European Association for Computer Science Logic (CSL '02), volume 2471 of LNCS, pages 2-26. Springer.
11. [Seidl et al., 2003] Seidl, H., Schwentick, T., and Muscholl, A. (2003). Numerical Document Queries. In Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 155-166. ACM.
12. [Stirling and Walker, 1991] Stirling, C. and Walker, D. (1991). Local model checking in the modal mu-calculus. Theoretical Computer Science, 89:161-177.
13. [Stockmeyer, 1976] Stockmeyer, L. J. (1976). The Polynomial-time Hierarchy. Theoretical Computer Science, 3(1): 1-22.
14. [Winskel, 1991] Winskel, G. (1991). A note on model checking the modal v-calculus. Theoretical Computer Science, 83:157-167.