Model-checking hierarchical structures
type: Item
instance of: scholarly article
title: Model-checking hierarchical structures
zbMATH Open document ID: 1279.68213
author: Markus Lohrey
published in: Journal of Computer and System Sciences
publication date: 2012-05-11T00:00:00Z
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 03B70
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 6033505
zbMATH Keywords: model-checking
zbMATH Keywords: hierarchical structures
zbMATH Keywords: logic in computer science
zbMATH Keywords: complexity
MaRDI profile type: Publication
full work available at URL: j.jcss.2011.05.006
OpenAlex ID: W1980407685
cites work: A very hard log-space counting class
cites work: Non-deterministic exponential time has two-prover interactive protocols
cites work: On uniformity within \(NC^ 1\)
cites work: Succinct circuit representations and leaf language classes are basically the same concept
cites work: Alternation
cites work: A uniform method for proving lower bounds on the computational complexity of logical theories
cites work: Q4385531
cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
cites work: Q4714446
cites work: Q4058132
cites work: The first order properties of products of algebraic systems
cites work: Q4267798
cites work: Deciding first-order properties of locally tree-decomposable structures
cites work: The complexity of first-order and monadic second-order logic revisited
cites work: Q3666827
cites work: Succinct representations of graphs
cites work: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
cites work: Existential second-order logic over graphs
cites work: Succinctness as a source of complexity in logical formalisms
cites work: Hyperedge replacement: grammars and languages
cites work: Nondeterministic Space is Closed under Complementation
cites work: Expressibility and Parallel Complexity
cites work: Q4227581
cites work: Application of model theoretic games to discrete linear orders and finite automata
cites work: Hierarchical planarity testing algorithms
cites work: The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems
cites work: Efficient Solution of Connectivity Problems on Hierarchically Defined Graphs
cites work: Elements of finite model theory.
cites work: Complexity classes and theories of finite models
cites work: Algorithmic uses of the Feferman-Vaught theorem
cites work: Arity and alternation in second-order logic
cites work: Q4764625
cites work: Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems
cites work: Hierarchically specified unit disk graphs
cites work: CONCUR 2003 - Concurrency Theory
cites work: Q3221403
cites work: A note on succinct representations of graphs
cites work: Relationships between nondeterministic and deterministic tape complexities
cites work: Decidability of DPDA equivalence
cites work: The polynomial-time hierarchy
cites work: Q4302435
cites work: The method of forced enumeration for nondeterministic automata
cites work: Languages represented by Boolean formulas
cites work: Q4258578
cites work: Succinct representation, leaf languages, and projection reductions
cites work: Complete sets and the polynomial-time hierarchy
DOI: 10.1016/J.JCSS.2011.05.006
description: scientific article; zbMATH DE number 6033505