Relational queries computable in polynomial time
Information and Control
Efficient solution to connectivity problems on hierarchically defined graphs
SIAM Journal on Computing
Hierarchical planarity testing algorithms
Journal of the ACM (JACM)
Tree automata, Mu-Calculus and determinacy
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Journal of Computer and System Sciences
On the complexity of bounded-variable queries (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Handbook of formal languages, vol. 3
Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems
SIAM Journal on Computing
Deciding the winner in parity games is in UP ∩ co-UP
Information Processing Letters
On model checking for the &mgr;-calculus and its fragments
Theoretical Computer Science
Model checking of hierarchical state machines
ACM Transactions on Programming Languages and Systems (TOPLAS)
Small Progress Measures for Solving Parity Games
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Bounded-Variable Fixpoint Queries are PSPACE-complete
CSL '96 Selected Papers from the10th International Workshop on Computer Science Logic
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Automata logics, and infinite games: a guide to current research
Automata logics, and infinite games: a guide to current research
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Elements Of Finite Model Theory (Texts in Theoretical Computer Science. An Eatcs Series)
Model-Checking Hierarchical Structures
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Improved model checking of hierarchical systems
Information and Computation
Model-checking hierarchical structures
Journal of Computer and System Sciences
Improved model checking of hierarchical systems
VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
Synthesis of hierarchical systems
Science of Computer Programming
| Hi-index | 0.00 |
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph definitions allow to specify graphs of exponential size using polynomial size descriptions. In many cases, this succinctness increases the computational complexity of decision problems. In this paper, the model-checking problem for the modal μ-calculus and (monadic) least fixpoint logic on hierarchically defined graphs is investigated. In order to analyze the modal μ-calculus, parity games on hierarchically defined graphs are studied.