Fixpoint logics on hierarchical structures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3821 LNCS, Issue , 2005, Pages 483-494

  Göller, Stefan ^a   Lohrey, Markus ^a  

^a UNIVERSITY OF STUTTGART   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DECISION MAKING; GRAPH THEORY; HIERARCHICAL SYSTEMS; POLYNOMIALS; PROBLEM SOLVING; SPECIFICATIONS;

DECISION PROBLEMS; FIXPOINT LOGICS; MODEL-CHECKING PROBLEM; POLYNOMIAL SIZE DESCRIPTIONS;

FORMAL LOGIC;

EID: 33744902362     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11590156_39     Document Type: Conference Paper

References (22)

1. R. Alur and M. Yannakakis. Model checking of hierarchical state machines. ACM Trans. Program. Lang. Syst., 23(3):273-303, 2001.
2. S. Dziembowski. Bounded-variable fixpoint queries are PSPACE-complete. In Proc. CSL'96, LNCS 1258, pages 89-105. Springer, 1996.
3. E. A. Emerson and C. S. Jutla. Tree automata, mu-calculus and determinacy (extended abstract). In Proc. FOCS'91, pages 132-142. IEEE Computer Society Press, 1991.
4. E. A. Emerson, C. S. Jutla, and A. P. Sistla. On model checking for the μ-calculus and its fragments. Theor. Comput. Sci., 258(1-2):491-522, 2001.
5. E. A. Emerson and C.-L. Lei. Efficient model checking in fragments of the propositional mu-calculus (extended abstract). In Proc. LICS'86, pages 267-278. IEEE Computer Society Press, 1986.
6. 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.
7. S. Göller and M. Lohrey. Fixpoint logics on hierarchical structures. Tech. Rep. 2005/3, University of Stuttgart, Germany, 2005. ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/TR-2005-04/.
8. E. Grädel, W. Thomas, and T. Wilke. Automata, Logics, and Infinite Games. LNCS 2500. Springer, 2002.
9. N. Immerman. Relational queries computable in polynomial time. Inf. Control, 68(1-3):86-104, 1986.
10. M. Jurdziński. Deciding the winner in parity games is in UP and co-UP. Inf. Process. Lett., 68(3): 119-124, 1998.
11. M. Jurdziński. Small progress measures for solving parity games. In Proc. STAGS 2000, LNCS 1770, pages 290-301. Springer, 2000.
12. T. Lengauer. Hierarchical planarity testing algorithms. J. Assoc. Comput. Mach., 36(3):474-509, 1989.
13. T. Lengauer and K. W. Wagner. The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems. J. Comput. Syst. Sci., 44:63-93, 1992.
14. T. Lengauer and E. Wanke. Efficient solution of connectivity problems on hierarchically defined graphs. SIAM J. Comput., 17(6): 1063-1080, 1988.
15. L. Libkin. Elements of Finite Model Theory. Springer, 2004.
16. M. Lohrey. Model-checking hierarchical graphs. Tech. Rep. 2005/1, University of Stuttgart, Germany, 2005. ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart.fi/TR-2005-1/.
17. M. Lohrey. Model-checking hierarchical structures. In Proc. LICS 2005, pages 168-177. IEEE Computer Society Press, 2005.
18. 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): 1237-1261, 1998.
19. J. Obdržálek. Fast mu-calculus model checking when tree-width is bounded. In CAV'03, LNCS 2725, pages 80-92. Springer, 2003.
20. C. H. Papadimitriou. Computational Complexity. Addison Wesley, 1994.
21. M. Y. Vardi. The complexity of relational query languages (extended abstract). In Proc. STOC 1982, pages 137-146. ACM Press, 1982.
22. M. Y. Vardi. On the complexity of bounded-variable queries. In Proc. PODS 1995, pages 266-276. ACM Press, 1995.