The complexity of model checking higher order fixpoint logic

Authors:
Martin Lange;Rafał Somla
Affiliations:
Institut für Informatik, University of Munich, Germany;IT department, Uppsala University, Sweden
Venue:
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Year:
2005

Citing 15
Cited 0

Decision procedures and expressiveness in the temporal logic of branching time

Journal of Computer and System Sciences
“Sometimes” and “not never” revisited: on branching versus linear time temporal logic

Journal of the ACM (JACM) - The MIT Press scientific computation series
Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Uniform inevitability is tree automaton ineffable

Information Processing Letters
Tree automata, Mu-Calculus and determinacy

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Symbolic model checking: 1020 states and beyond

Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Alternation

Journal of the ACM (JACM)
Bounded Model Checking Using Satisfiability Solving

Formal Methods in System Design
Mona: Monadic Second-Order Logic in Practice

TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
On the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic

CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Model Checking Fixed Point Logic with Chop

FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Inflationary Fixed Points in Modal Logic

CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
The complexity of translating logic to finite automata

Automata logics, and infinite games
The temporal logic of programs

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
A modal fixpoint logic with chop

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper analyzes the computational complexity of the model checking problem for Higher Order Fixpoint Logic – the modal μ-calculus enriched with a typed λ-calculus. It is hard for every level of the elementary time/space hierarchy and in elementary time/space when restricted to formulas of bounded type order.