Fast and simple nested fixpoints

DOI10.1016/0020-0190(96)00130-5zbMath0900.68458OpenAlexW2051491228MaRDI QIDQ1350911

Helmut Seidl

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(96)00130-5

zbMATH Keywords

Model-checkingEvaluation of fixpoint expressionsHierarchical systems of equations

Mathematics Subject Classification ID

Related Items (19)

On the universal and existential fragments of the \(\mu\)-calculus ⋮ The mu-calculus and Model Checking ⋮ Deciding Parity Games in Quasi-polynomial Time ⋮ Universal algorithms for parity games and nested fixpoints ⋮ Games for synthesis of controllers with partial observation. ⋮ Solving parity games by a reduction to SAT ⋮ Improved complexity analysis of quasi-polynomial algorithms solving parity games ⋮ Unnamed Item ⋮ Inf-datalog, Modal Logic and Complexities ⋮ Assume-admissible synthesis ⋮ A Multi-Core Solver for Parity Games ⋮ Bridging the gap between fair simulation and trace inclusion ⋮ Unnamed Item ⋮ Three notes on the complexity of model checking fixpoint logic with chop ⋮ The alternation hierarchy in fixpoint logic with chop is strict too ⋮ Solving μ-Calculus Parity Games by Symbolic Planning ⋮ Quasipolynomial computation of nested fixpoints ⋮ Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time ⋮ Pushdown processes: Games and model-checking

Cites Work

• Unnamed Item
• Results on the propositional \(\mu\)-calculus
• Automata-theoretic techniques for modal logics of programs
• A linear algorithm to solve fixed-point equations on transition systems
• Symbolic model checking: \(10^{20}\) states and beyond
• Model checking and boolean graphs
• An improved algorithm for the evaluation of fixpoint expressions
• A linear-time model-checking algorithm for the alternation-free modal mu- calculus
• On model checking for the \(\mu\)-calculus and its fragments

This page was built for publication: Fast and simple nested fixpoints