Three notes on the complexity of model checking fixpoint logic with chop
From MaRDI portal
Recommendations
Cites work
- A higher order modal fixed point logic
- A modal fixpoint logic with chop
- Alternating context-free languages and linear time -calculus with sequential composition
- An improved algorithm for the evaluation of fixpoint expressions
- Automata, logics, and infinite games. A guide to current research
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Fast and simple nested fixpoints
- Inflationary fixed points in modal logic
- Local model checking games for fixed point logic with chop
- Mathematical Foundations of Computer Science 2005
- Model checking fixed point logic with chop
- On model checking for the -calculus and its fragments
- Programming languages and their definition. Selected papers ed. by C. B. Jones
- Pushdown processes: Games and model-checking
- Results on the propositional \(\mu\)-calculus
- Small progress measures for solving parity games
- Tableau-based model checking in the propositional mu-calculus
Cited in
(11)- Temporal logic with recursion
- The alternation hierarchy in fixpoint logic with chop is strict too
- Parallel and symbolic model checking for fixpoint logic with chop
- The complexity of independence-friendly fixpoint logic
- A modal fixpoint logic with chop
- Local model checking games for fixed point logic with chop
- Model checking fixed point logic with chop
- Theoretical Aspects of Computing – ICTAC 2005
- Temporal Logic with Recursion.
- Separating the expressive power of propositional dynamic and modal fixpoint logics
- Propositional dynamic logic of context-free programs and fixpoint logic with chop
This page was built for publication: Three notes on the complexity of model checking fixpoint logic with chop
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5441546)