Model-checking hierarchical structures

Journal of Computer and System Sciences

Volumn 78, Issue 2, 2012, Pages 461-490

  Lohrey, Markus ^a  

^a UNIVERSITY OF STUTTGART   (Germany)

Author keywords

Complexity; Hierarchical structures; Logic in computer science; Model checking

Indexed keywords

COMPUTER CIRCUITS; GRAPH ALGORITHMS; POLYNOMIAL APPROXIMATION;

COMPLEXITY; HIERARCHICAL GRAPHS; HIERARCHICAL STRUCTURES; LOGIC IN COMPUTER SCIENCE; MODEL CHECKING ALGORITHM; MODEL CHECKING PROBLEM; MONADIC SECOND-ORDER LOGIC; POLYNOMIAL-TIME HIERARCHY;

MODEL CHECKING;

EID: 84855987726     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/j.jcss.2011.05.006     Document Type: Article

References (53)

1. R. Alur, M. Benedikt, K. Etessami, P. Godefroid, T.W. Reps, and M. Yannakakis Analysis of recursive state machines ACM Trans. Programm. Lang. Syst. (TOPLAS) 27 4 2005 786 818 (Pubitemid 43942505)
2. R. Alur, and M. Yannakakis Model checking of hierarchical state machines ACM Trans. Programm. Lang. Syst. (TOPLAS) 23 3 2001 273 303 (Pubitemid 33614271)
3. C. Àlvarez, and B. Jenner A very hard log-space counting class Theoret. Comput. Sci. 107 1 1993 3 30
4. L. Babai, L. Fortnow, and C. Lund Non-deterministic exponential time has two-prover interactive protocols Comput. Complexity 1 1991 3 40
5. 1 J. Comput. System Sci. 41 1990 274 306
6. B. Borchert, and A. Lozano Succinct circuit representations and leaf language classes are basically the same concept Inform. Process. Lett. 59 4 1996 211 215 (Pubitemid 126392475)
7. A.K. Chandra, D.C. Kozen, and L.J. Stockmeyer Alternation J. ACM 28 1 1981 114 133
8. K.J. Compton, and C.W. Henson A uniform method for proving lower bounds on the computational complexity of logical theories Ann. Pure Appl. Logic 48 1990 1 79
9. B. Courcelle Graph rewriting: An algebraic and logic approach J. van Leeuwen, Handbook of Theoretical Computer Science, vol. B 1990 Elsevier Science Publishers 193 242
10. B. Courcelle The monadic second-order logic of graphs. I. Recognizable sets of finite graphs Inform. and Comput. 85 1990 12 75 (Pubitemid 20680563)
11. H.-D. Ebbinghaus, and J. Flum Finite Model Theory 1991 Springer
12. J. Engelfriet Context-free graph grammars G. Rozenberg, A. Salomaa, Handbook of Formal Languages, vol. 3: Beyond Words 1997 Springer 125 213
13. R. Fagin Generalized first-order spectra and polynomial-time recognizable sets R.M. Karp, Complexity and Computation, SIAM-AMS Proceedings, vol. 7 1974 43 73
14. S. Feferman, and R.L. Vaught The first order properties of products of algebraic systems Fund. Math. 47 1959 57 103
15. J. Feigenbaum, S. Kannan, M.Y. Vardi, and M. Viswanathan The complexity of problems on graphs represented as OBDDs Chic. J. Theoret. Comput. Sci. 1999 1999
16. M. Frick, and M. Grohe Deciding first-order properties of locally tree-decomposable structures J. ACM 48 6 2001 1184 1206
17. M. Frick, and M. Grohe The complexity of first-order and monadic second-order logic revisited Ann. Pure Appl. Logic 130 1-3 2004 3 31 (Pubitemid 40393343)
18. H. Gaifman On local and nonlocal properties J. Stern, Logic Colloquium 81 1982 North-Holland 105 135
19. H. Galperin, and A. Wigderson Succinct representations of graphs Information and Control 56 3 1983 183 198
20. S. Göller, and M. Lohrey Fixpoint logics on hierarchical structures R. Ramanujam, Sandeep Sen, Proceedings of the 25th International Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2005) Hyderabad, India Lecture Notes in Comput. Sci. vol. 3821 2005 Springer 483 494 (Pubitemid 43846928)
21. G. Gottlob, P.G. Kolaitis, and T. Schwentick Existential second-order logic over graphs: Charting the tractability frontier J. ACM 51 2 2004 312 362
22. G. Gottlob, N. Leone, and H. Veith Succinctness as a source of complexity in logical formalisms Ann. Pure Appl. Logic 97 1-3 1999 231 260
23. A. Habel Hyperedge Replacement: Grammars and Languages Lecture Notes in Comput. Sci. vol. 643 1992 Springer
24. N. Immerman Nondeterministic space is closed under complementation SIAM J. Comput. 17 5 1988 935 938
25. N. Immerman Expressibility and parallel complexity SIAM J. Comput. 18 3 1989 625 638
26. N. Immerman Descriptive Complexity 1999 Springer
27. R.E. Ladner Application of model theoretic games to discrete linear orders and finite automata Inform. and Comput. 33 4 1977 281 303
28. T. Lengauer Hierarchical planarity testing algorithms J. ACM 36 3 1989 474 509
29. T. Lengauer, and K.W. Wagner The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems J. Comput. System Sci. 44 1992 63 93
30. T. Lengauer, and E. Wanke Efficient solution of connectivity problems on hierarchically defined graphs SIAM J. Comput. 17 6 1988 1063 1080
31. L. Libkin Elements of Finite Model Theory 2004 Springer
32. M. Lohrey Model-checking hierarchical structures Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science (LICS 2005) Chicago, USA 2005 IEEE Computer Society Press 168 177 (Pubitemid 41462564)
33. J.F. Lynch Complexity classes and theories of finite models Math. Systems Theory 15 1982 127 144
34. J.A. Makowsky Algorithmic aspects of the Feferman-Vaught theorem Ann. Pure Appl. Logic 126 1-3 2004 159 213
35. J.A. Makowsky, and Y.B. Pnueli Arity and alternation in second-order logic Ann. Pure Appl. Logic 78 1-3 1996 189 202 (Pubitemid 126160882)
36. M.V. Marathe, H.B. Hunt III, and S.S. Ravi The complexity of approximation PSPACE-complete problems for hierarchical specifications Nordic J. Comput. 1 3 1994 275 316
37. M.V. Marathe, H.B. Hunt III, R.E. Stearns, and V. Radhakrishnan Approximation algorithms for PSPACE-hard hierarchically and periodically specified problems SIAM J. Comput. 27 5 1998 1237 1261 (Pubitemid 128689471)
38. M.V. Marathe, V. Radhakrishnan, H.B. Hunt III, and S.S. Ravi Hierarchically specified unit disk graphs Theoret. Comput. Sci. 174 1-2 1997 23 65 (Pubitemid 127452776)
39. N. Markey, and P. Schnoebelen Model checking a path Proceedings of the 14th International Conference on Concurrency Theory (CONCUR 2003) Marseille, France Lecture Notes in Comput. Sci. vol. 2761 2003 248 262
40. C.H. Papadimitriou Computational Complexity 1994 Addison-Wesley
41. C.H. Papadimitriou, and M. Yannakakis A note on succinct representations of graphs Information and Control 71 3 1986 181 185
42. W.J. Savitch Relationships between nondeterministic and deterministic tape complexities J. Comput. System Sci. 4 2 1970 177 192
43. C. Stirling Modal and Temporal Properties of Processes 2001 Springer
44. L.J. Stockmeyer The polynomial-time hierarchy Theoret. Comput. Sci. 3 1 1976 1 22
45. H. Straubing Finite Automata, Formal Logic, and Circuit Complexity 1994 Birkhäuser Boston, Basel, Berlin
46. R. Szelepcsényi The method of forced enumeration for nondeterministic automata Acta Inform. 26 3 1988 279 284
47. W. Thomas Languages, automata, and logic G. Rozenberg, A. Salomaa, Handbook of Formal Languages, vol. III 1997 Springer 389 455
48. M.Y. Vardi The complexity of relational query languages (extended abstract) Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing (STOC 1982) 1982 ACM Press 137 146
49. M.Y. Vardi On the complexity of bounded-variable queries Proceedings of the Fourteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS 1995) 1995 ACM Press 266 276
50. H. Veith Languages represented by Boolean formulas Inform. Process. Lett. 63 5 1997 251 256 (Pubitemid 127403906)
51. H. Veith How to encode a logical structure by an OBDD Proceedings of the 13th Annual IEEE Conference on Computational Complexity 1998 IEEE Computer Society Press 122 131
52. H. Veith Succinct representation, leaf languages, and projection reductions Inform. and Comput. 142 2 1998 207 236 (Pubitemid 128451164)
53. C. Wrathall Complete sets and the polynomial-time hierarchy Theoret. Comput. Sci. 3 1 1976 23 33