The modal mu-calculus alternation hierarchy is strict
From MaRDI portal
Publication:1276239
DOI10.1016/S0304-3975(97)00217-XzbMath0915.03017MaRDI QIDQ1276239
Publication date: 20 January 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (33)
On the universal and existential fragments of the \(\mu\)-calculus ⋮ The mu-calculus and Model Checking ⋮ Symbolic Model Checking in Non-Boolean Domains ⋮ $\aleph_1$ and the modal $\mu$-calculus ⋮ The \(\mu\)-calculus alternation depth hierarchy is infinite over finite planar graphs ⋮ On the \(\mu \)-calculus over transitive and finite transitive frames ⋮ Fixed point characterization of infinite behavior of finite-state systems ⋮ On the equational definition of the least prefixed point. ⋮ A gap property of deterministic tree languages. ⋮ The alternation hierarchy of the \(\mu \)-calculus over weakly transitive frames ⋮ The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata ⋮ Unnamed Item ⋮ Model checking the full modal mu-calculus for infinite sequential processes ⋮ The Descriptive Complexity of Parity Games ⋮ The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity ⋮ Model checking properties on reduced trace systems ⋮ Canonical completeness of infinitary \(\mu \) ⋮ Deciding low levels of tree-automata hierarchy ⋮ Ambiguous classes in \(\mu\)-calculi hierarchies ⋮ Fixpoint alternation: arithmetic, transition systems, and the binary tree ⋮ On modal \(\mu\)-calculus with explicit interpolants ⋮ The alternation hierarchy in fixpoint logic with chop is strict too ⋮ Free \(\mu\)-lattices ⋮ Unnamed Item ⋮ On the Way to Alternating Weak Automata ⋮ Fixpoints, games and the difference hierarchy ⋮ The modal mu-calculus alternation hierarchy is strict ⋮ Linear Game Automata: Decidable Hierarchy Problems for Stripped-Down Alternating Tree Automata ⋮ Automata on infinite trees ⋮ The modalμ-calculus hierarchy over restricted classes of transition systems ⋮ Mu-calculus path checking ⋮ Yet another hierarchy theorem ⋮ On the expressive power of monadic least fixed point logic
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Programming languages and their definition. Selected papers ed. by C. B. Jones
- Results on the propositional \(\mu\)-calculus
- A finite model theorem for the propositional \(\mu\)-calculus
- An automata theoretic decision procedure for the propositional mu- calculus
- Elementary induction on abstract structures
- The modal mu-calculus alternation hierarchy is strict
- On modal mu-calculus and Büchi tree automata
- An improved algorithm for the evaluation of fixpoint expressions
- On the expressivity of the modal mu-calculus
- μ-definable sets of integers
- On model checking for the \(\mu\)-calculus and its fragments
This page was built for publication: The modal mu-calculus alternation hierarchy is strict
