Model-checking hierarchical structures

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2005, Pages 168-177

  Lohrey, Markus ^a  

^a UNIVERSITY OF STUTTGART   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FORMAL LOGIC; HIERARCHICAL SYSTEMS; POLYNOMIALS; PROBLEM SOLVING; SPECIFICATIONS;

FIRST-ORDER LOGIC; HIERARCHICAL STRUCTURES; MODEL-CHECKING PROBLEM; MONADIC SECOND ORDER (MSO) LOGIC;

GRAPH THEORY;

EID: 26844568062     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (32)

1. R. Alur and M. Yannakakis. Model checking of hierarchical state machines. ACM Transactions on Programming Languages and Systems (TOPLAS), 23(3):273-303, 2001.
2. L. Babai, L. Fortnow, and C. Lund. Non-deterministic exponential time has two-prover interactive protocols. Computational Complexity, 1:3-40, 1991.
3. A. K. Chandra, D. C. Kozen, and L. J. Stockmeyer. Alternation. Journal of the Association for Computing Machinery, 28(1):114-133, 1981.
4. B. Courcelle. Graph rewriting: An algebraic and logic approach. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 193-242. Elsevier Science Publishers, 1990.
5. J. Engelfriet. Context-free graph grammars. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, Volume 3: Beyond Words, pages 125-213. Springer, 1997.
6. R. Fagin. Generalized first-order spectra and polynomial-time recognizable sets. In R. M. Karp, editor, Complexity and Computation, volume 7 of SIAM-AMS Proceedings, pages 43-73, 1974.
7. J. Feigenbaum, S. Kannan, M. Y. Vardi, and M. Viswanathan. The complexity of problems on graphs represented as OBDDs. Chicago Journal of Theoretical Computer Science, 1999.
8. M. Frick and M. Grohe. Deciding first-order properties of locally tree-decomposable structures. Journal of the Association for Computing Machinery, 48(6):1184-1206, 2001.
9. M. Frick and M. Grohe. The complexity of first-order and monadic second-order logic revisited. In Proc. LICS'2002, pages 215-224. IEEE Computer Society Press, 2002.
10. H. Gaifman. On local and nonlocal properties. In J. Stern, editor, Logic Colloquium '81, pages 105-135. North Holland, 1982.
11. H. Galperin and A. Wigderson. Succinct representations of graphs. Information and Control, 56(3):183-198, 1983.
12. G. Gottlob, P. G. Kolaitis, and T. Schwentick. Existential second-order logic over graphs: Charting the tractability frontier. Journal of the Association for Computing Machinery, 51(2):312-362, 2004.
13. G. Gottlob, N. Leone, and H. Veith. Succinctness as a source of complexity in logical formalisms. Annals of Pure and Applied Logic, 97(1-3):231-260, 1999.
14. N. Immerman. Expressibility and parallel complexity. SIAM Journal on Computing, 18(3):625-638, 1989.
15. T. Lengauer. Hierarchical planarity testing algorithms. Journal of the Association for Computing Machinery, 36(3):474-509, 1989.
16. T. Lengauer and K. W. Wagner. The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems. Journal of Computer and System Sciences, 44:63-93, 1992.
17. T. Lengauer and E. Wanke. Efficient solution of connectivity problems on hierarchically defined graph. SIAM Journal on Computing, 17(6):1063-1080, 1988.
18. L. Libkin. Elements of Finite Model Theory. Springer, 2004.
19. M. Lohrey. Model-checking hierarchical structures. Technical Report 2005/1, University of Stuttgart, Germany, 2005. Available via ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/ TR-2005-01/.
20. J. F. Lynch. Complexity classes and theories of finite models. Mathematical Systems Theory, 15:127-144, 1982.
21. J. A. Makowsky. Algorithmic aspects of the Feferman-Vaught theorem. Annals of Pure and Applied Logic, 126(1-3):159-213, 2004.
22. J. A. Makowsky and Y. B. Pnueli. Arity and alternation in second-order logic. Annals of Pure and Applied Logic, 78(1-3):189-202, 1996.
23. M. V. Marathe, H. B. Hunt III, R. E. Stearns, and V. Radhakrishnan. Approximation algorithms for PSPACE-hard hierarchically and periodically specified problems. SIAM Journal on Computing, 27(5):1237-1261, 1998.
24. N. Markey and Ph. Scnnoebelen. Model checking a path. In Proc. CONCUR 2003, LNCS 2761, pages 248-262. Springer 2003.
25. C. H. Papadimitriou and M. Yannakakis. A note on succinct representations of graphs. Information and Control, 71(3):181-185, 1986.
26. L. J. Stockmeyer. The polynomial-time hierarchy. Theoretical Computer Science, 3(1):1-22, 1976.
27. M. Y. Vardi. The complexity of relational query languages (extended abstract). In Proc. STOC 1982, pages 137-146. ACM Press, 1982.
28. M. Y. Vardi. On the complexity of bounded-variable queries. In Proc. PODS 1995, pages 266-276. ACM Press, 1995.
29. H. Veith. Languages represented by Boolean formulas. Information Processing Letters, 63(5):251-256, 1997.
30. H. Veith. How to encode a logical structure by an OBDD. In Proc. of the 13th Annual IEEE Conference on Computational Complexity, pages 122-131. IEEE Computer Society, 1998.
31. H. Veith. Succinct representation, leaf languages, and projection reductions. Information and Computation, 142(2):207-236, 1998.
32. C. Wrathall. Complete sets and the polynomial-time hierarchy. Theoretical Computer Science, 3(1):23-33, 1976.