scientific article; zbMATH DE number 2102739
From MaRDI portal
Publication:4818826
zbMath1045.03516MaRDI QIDQ4818826
Publication date: 24 September 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Temporal logic (03B44)
Related Items (18)
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 ⋮ Unnamed Item ⋮ The \(\mu\)-calculus alternation hierarchy collapses over structures with restricted connectivity ⋮ Canonical completeness of infinitary \(\mu \) ⋮ \(\varSigma^{\mu}_2\) is decidable for \(\varPi^{\mu}_2\) ⋮ Ambiguous classes in \(\mu\)-calculi hierarchies ⋮ Theμ-calculus alternation-depth hierarchy is strict on binary trees ⋮ Fixpoint alternation: arithmetic, transition systems, and the binary tree ⋮ On Distributive Fixed-Point Expressions ⋮ The alternation hierarchy in fixpoint logic with chop is strict too ⋮ Free \(\mu\)-lattices ⋮ The modal mu-calculus alternation hierarchy is strict ⋮ Automata on infinite trees
This page was built for publication:
